Gabriel Istrate

Publication Activity (10 Years)

Years Active: 1991-2024
Publications (10 Years): 33

Top Topics

Top Venues

Theor. Comput. Sci.

Sci. Ann. Comput. Sci.

Publications

Gabriel Istrate
A Language-Theoretic Approach to the Heapability of Signed Permutations. CoRR (2024)
Gabriel Istrate, Cosmin Bonchis, Victor Bogdan
Equilibria in multiagent online problems with predictions. CoRR (2024)
Gabriel Istrate, Cosmin Bonchis
A parametric worst-case approach to fairness in cooperative games with transferable utility. Theor. Comput. Sci. 940 (Part) (2023)
Gabriel Istrate, Romeo Negrea
q-Overlaps in the Random Exact Cover Problem. FROM (2023)
Gabriel Istrate
Some Remarks on Almost Periodic Sequences and Languages. CoRR (2022)
Gabriel Istrate, Cosmin Bonchis
Mechanism Design With Predictions for Obnoxious Facility Location. CoRR (2022)
Gabriel Istrate, Cosmin Bonchis
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. AAMAS (2022)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. CoRR (2021)
Gabriel Istrate
Models We Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation. AAMAS (2021)
Gabriel Istrate, Cosmin Bonchis, Adrian Craciun
Kernelization, Proof Complexity and Social Choice. ICALP (2021)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. Algorithmica 83 (8) (2021)
Gabriel Istrate
Models we Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation. CoRR (2021)
Gabriel Istrate, Cosmin Bonchis, Adrian Craciun
Kernelization, Proof Complexity and Social Choice. CoRR (2021)
Gabriel Istrate
Game-Theoretic Models of Moral and Other-Regarding Agents (extended abstract). TARK (2021)
Gabriel Istrate
Game-theoretic Models of Moral and Other-Regarding Agents. CoRR (2020)
Gabriel Istrate, Cosmin Bonchis, Claudiu Gatina
It's Not Whom You Know, It's What You, or Your Friends, Can Do: Coalitional Frameworks for Network Centralities. AAMAS (2020)
Gabriel Istrate, Cosmin Bonchis
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. CoRR (2020)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. ESA (2020)
János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate, Ioan Todinca
On the heapability of finite partial orders. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC (2020)
Gabriel Istrate, Cosmin Bonchis, Alin Brîndusescu
Attacking Power Indices by Manipulating Player Reliability. AAMAS (2019)
Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu
The Maximum Binary Tree Problem. CoRR (2019)
Gabriel Istrate, Cosmin Bonchis, Claudiu Gatina
It's Not Whom You Know, It's What You (or Your Friends) Can Do: Succint Coalitional Frameworks for Network Centralities. CoRR (2019)
Gabriel Istrate, Cosmin Bonchis, Mircea Marin
Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm. CoRR (2019)
Gabriel Istrate, Cosmin Bonchis, Alin Brîndusescu
Attacking Power Indices by Manipulating Player Reliability. CoRR (2019)
Cosmin Bonchis, Gabriel Istrate, Vlad Rochian
The language (and series) of Hammersley-type processes. CoRR (2018)
Gabriel Istrate
Stochastic Stability in Schelling's Segregation Model with Markovian Asynchronous Update. ACRI (2018)
Cosmin Bonchis, Gabriel Istrate, Vlad Rochian
The Language (and Series) of Hammersley-Type Processes. MCU (2018)
James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
Short proofs of the Kneser-Lovász coloring principle. Inf. Comput. 261 (2018)
Gabriel Istrate
Stochastic Stability in Schelling's Segregation Model with Markovian Asynchronous Update. CoRR (2018)
János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate
Computing a minimal partition of partial orders into heapable subsets. CoRR (2017)
Gabriel Istrate, Cosmin Bonchis
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. DCFS (2016)
Gabriel Istrate, Cosmin Bonchis, Liviu P. Dinu
The Minimum Entropy Submodular Set Cover Problem. LATA (2016)
Gabriel Istrate, Cosmin Bonchis
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process. CoRR (2015)
Gabriel Istrate, Cosmin Bonchis
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process. CPM (2015)
Gabriel Istrate
Identifying Almost Sorted Permutations from TCP Buffer Dynamics. Sci. Ann. Comput. Sci. 25 (1) (2015)
James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
Short Proofs of the Kneser-Lovász Coloring Principle. CoRR (2015)
James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate
Short Proofs of the Kneser-Lovász Coloring Principle. ICALP (2) (2015)
Gabriel Istrate
Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs. Theor. Comput. Sci. 580 (2015)
Mircea Marin, Gabriel Istrate
Learning Cover Context-Free Grammars from Structural Data. ICTAC (2014)
Cosmin Bonchis, Gabriel Istrate
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. Inf. Process. Lett. 114 (7) (2014)
Gabriel Istrate, Adrian Craciun
Proof Complexity and the Kneser-Lovász Theorem (I). CoRR (2014)
Cosmin Bonchis, Gabriel Istrate
Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games). CoRR (2014)
Mircea Marin, Gabriel Istrate
Learning Cover Context-Free Grammars from Structural Data. Sci. Ann. Comput. Sci. 24 (2) (2014)
Gabriel Istrate, Adrian Craciun
Proof Complexity and the Kneser-Lovász Theorem. SAT (2014)
Mircea Marin, Gabriel Istrate
Learning cover context-free grammars from structural data. CoRR (2014)
Cosmin Bonchis, Gabriel Istrate
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem CoRR (2012)
Gabriel Istrate
Review of handbook of large-scale random networks by Bela Bollobás, Robert Kozma and Deszö Miklós. SIGACT News 43 (2) (2012)
Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
Adversarial scheduling in discrete models of social dynamics. Math. Struct. Comput. Sci. 22 (5) (2012)
Cosmin Bonchis, Gabriel Istrate
A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games CoRR (2012)
Gabriel Istrate
Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) on hypergraphs CoRR (2011)
Gabriel Istrate
. J. Artif. Soc. Soc. Simul. 12 (4) (2009)
Gabriel Istrate
SAT. Int. J. Comput. Math. 86 (12) (2009)
Gabriel Istrate
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT). Fundam. Informaticae 91 (2) (2009)
Gabriel Istrate
On Hadwiger's Number of a graph with partial information CoRR (2009)
Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion CoRR (2008)
Gabriel Istrate
On the dynamics of Social Balance on general networks (with an application to XOR-SAT) CoRR (2008)
Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
Adversarial Scheduling in Evolutionary Game Dynamics CoRR (2008)
Gabriel Istrate
Geometric properties of satisfying assignments of random ε-1-in-k SAT CoRR (2008)
Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion. CiE (2008)
Allon G. Percus, Gabriel Istrate, Bruno Gonçalves, Robert Z. Sumi, Stefan Boettcher
The Peculiar Phase Structure of Random Graph Bisection CoRR (2008)
Gabriel Istrate
Identifying almost sorted permutations from TCP buffer dynamics CoRR (2008)
Anders Hansson, Gabriel Istrate
Counting preimages of TCP reordering patterns. Discret. Appl. Math. 156 (17) (2008)
Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. Random Struct. Algorithms 31 (2) (2007)
Gabriel Istrate
Satisfying assignments of Random Boolean CSP: Clusters and Overlaps CoRR (2007)
Anders Hansson, Gabriel Istrate
Counting preimages of TCP reordering patterns CoRR (2007)
Gabriel Istrate
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps. J. Univers. Comput. Sci. 13 (11) (2007)
Gabriel Istrate, Anders Hansson, Guanhua Yan
Packet Reordering Metrics: Some Methodological Considerations. ICNS (2006)
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasiviswanathan
Combinatorics of TCP reordering. J. Comb. Optim. 12 (1-2) (2006)
Gabriel Istrate, Anders Hansson, Sunil Thulasidasan, Madhav V. Marathe, Christopher L. Barrett
Semantic Compression of TCP Traces. Networking (2006)
Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. PerCom Workshops (2006)
Cristopher Moore, Gabriel Istrate, Demetrios D. Demopoulos, Moshe Y. Vardi
A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas. APPROX-RANDOM (2005)
Gabriel Istrate
Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems CoRR (2005)
Gabriel Istrate
Threshold properties of random boolean constraint satisfaction problems. Discret. Appl. Math. 153 (1-3) (2005)
Gabriel Istrate, Stefan Boettcher, Allon G. Percus
Spines of random constraint satisfaction problems: definition and connection with computational complexity. Ann. Math. Artif. Intell. 44 (4) (2005)
Gabriel Istrate, Stefan Boettcher, Allon G. Percus
Spines of Random Constraint Satisfaction Problems: Definition and Connection with Computational Complexity CoRR (2005)
Stefan Boettcher, Gabriel Istrate, Allon G. Percus
Spines of Random Constraint Satisfaction Problems: Definition and Impact on Computational Complexity. AI&M (2004)
Gabriel Istrate
The phase transition in random horn satisfiability and its algorithmic implications. Random Struct. Algorithms 20 (4) (2002)
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. Greenhill, Gabriel Istrate, Mark Jerrum
Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. 11 (2) (2002)
Gabriel Istrate
Phase Transitions and all that CoRR (2002)
Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore
The phase transition in 1-in-k SAT and NAE 3-SAT. SODA (2001)
Gabriel Istrate
On the Satisfiability of Random k-Horn Formulae. Graphs, Morphisms and Statistical Physics (2001)
Gabriel Istrate, Madhav V. Marathe, S. S. Ravi
Adversarial models in evolutionary game dynamics. SODA (2001)
Gabriel Istrate
Computational Complexity and Phase Transitions CoRR (2000)
Gabriel Istrate
Review of Parameterized Complexity by R. Downey and M. Fellows. SIGACT News 31 (4) (2000)
Gabriel Istrate
Dimension-Dependent behavior in the satisfability of random k-Horn formulae CoRR (2000)
Gabriel Istrate
Computational Complexity and Phase Transitions. Computational Complexity Conference (2000)
Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
On Bounded-Weight Error-Correcting Codes CoRR (1999)
Gabriel Istrate
The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications. SODA (1999)
Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate
A Note on Bounded-Weight Error-Correcting Codes. J. Univers. Comput. Sci. 5 (12) (1999)
Gabriel Istrate
The phase transition in random Horn satisfiability and its algorithmic implications CoRR (1999)
Gabriel Istrate
The Strong Equivalence of ET0L Grammars. Inf. Process. Lett. 62 (4) (1997)
Gabriel Istrate
Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems. CP (1997)
Gabriel Istrate
Self-reading sequences. Discret. Appl. Math. 50 (2) (1994)
Gabriel Istrate, Gheorghe Paun
Some Combinatorial Properties of Self-reading Sequences. Discret. Appl. Math. 55 (1) (1994)
Gabriel Istrate
The Strong Equivalence of ETOL Grammars. Developments in Language Theory (1993)
Cristian S. Calude, Gabriel Istrate, Marius Zimand
Recursive Baire Classification and Speedable Functions. Math. Log. Q. 38 (1) (1992)
Cristian Calude, Gabriel Istrate
Determining and Stationary Sets for Some Classes of Partial Recursive Functions. Theor. Comput. Sci. 82 (1) (1991)