Determining and Stationary Sets for Some Classes of Partial Recursive Functions. - Cristian Calude; Gabriel Istrate (Theor. Comput. Sci., 1991)

Recursive Baire Classification and Speedable Functions. - Cristian S. Calude; Gabriel Istrate; Marius Zimand (Math. Log. Q., 1992)

The Strong Equivalence of ETOL Grammars. - Gabriel Istrate (Developments in Language Theory, 1993)

Self-reading sequences. - Gabriel Istrate (Discret. Appl. Math., 1994)

Some Combinatorial Properties of Self-reading Sequences. - Gabriel Istrate; Gheorghe Paun (Discret. Appl. Math., 1994)

Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems. - Gabriel Istrate (CP, 1997)

The Strong Equivalence of ET0L Grammars. - Gabriel Istrate (Inf. Process. Lett., 1997)

On Bounded-Weight Error-Correcting Codes - Russell Bent; Michael Schear; Lane A. Hemaspaandra; Gabriel Istrate (CoRR, 1999)

A Note on Bounded-Weight Error-Correcting Codes. - Russell Bent; Michael Schear; Lane A. Hemaspaandra; Gabriel Istrate (J. Univers. Comput. Sci., 1999)

Computational Complexity and Phase Transitions. - Gabriel Istrate (CCC, 2000)

Dimension-Dependent behavior in the satisfability of random k-Horn formulae - Gabriel Istrate (CoRR, 2000)

Review of Parameterized Complexity by R. Downey and M. Fellows. - Gabriel Istrate (SIGACT News, 2000)

On the Satisfiability of Random k-Horn Formulae. - Gabriel Istrate (Graphs, Morphisms and Statistical Physics, 2001)

The phase transition in 1-in-k SAT and NAE 3-SAT. - Dimitris Achlioptas; Arthur D. Chtcherba; Gabriel Istrate; Cristopher Moore (SODA, 2001)

Adversarial models in evolutionary game dynamics. - Gabriel Istrate; Madhav V. Marathe; S. S. Ravi (SODA, 2001)

Phase Transitions and all that - Gabriel Istrate (CoRR, 2002)

Convergence Of The Iterated Prisoner's Dilemma Game. - Martin E. Dyer; Leslie Ann Goldberg; Catherine S. Greenhill; Gabriel Istrate; Mark Jerrum (Comb. Probab. Comput., 2002)

The phase transition in random horn satisfiability and its algorithmic implications. - Gabriel Istrate (Random Struct. Algorithms, 2002)

Spines of Random Constraint Satisfaction Problems: Definition and Impact on Computational Complexity. - Stefan Boettcher; Gabriel Istrate; Allon G. Percus (AI&M, 2004)

Spines of random constraint satisfaction problems: definition and connection with computational complexity. - Gabriel Istrate; Stefan Boettcher; Allon G. Percus (Ann. Math. Artif. Intell., 2005)

Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems - Gabriel Istrate (CoRR, 2005)

Threshold properties of random boolean constraint satisfaction problems. - Gabriel Istrate (Discret. Appl. Math., 2005)

Introduction: Where Statistical Physics Mects Computation. - Allon G. Percus; Gabriel Istrate; Cristopher Moore (Computational Complexity and Statistical Physics, 2006)

Packet Reordering Metrics: Some Methodological Considerations. - Gabriel Istrate; Anders Hansson; Guanhua Yan (ICNS, 2006)

Semantic Compression of TCP Traces. - Gabriel Istrate; Anders Hansson; Sunil Thulasidasan; Madhav V. Marathe; Christopher L. Barrett (Networking, 2006)

Strong Edge Coloring for Channel Assignment in Wireless Radio Networks. - Christopher L. Barrett; V. S. Anil Kumar 001; Madhav V. Marathe; Shripad Thite; Gabriel Istrate (PerCom Workshops, 2006)

Combinatorics of TCP reordering. - Anders Hansson; Gabriel Istrate; Shiva Prasad Kasiviswanathan (J. Comb. Optim., 2006)

Satisfying assignments of Random Boolean CSP: Clusters and Overlaps - Gabriel Istrate (CoRR, 2007)

Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps. - Gabriel Istrate (J. Univers. Comput. Sci., 2007)

A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. - Cristopher Moore; Gabriel Istrate; Demetrios D. Demopoulos; Moshe Y. Vardi (Random Struct. Algorithms, 2007)

Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion. - Gabriel Istrate; Madhav V. Marathe; S. S. Ravi (CiE, 2008)

The Peculiar Phase Structure of Random Graph Bisection - Allon G. Percus; Gabriel Istrate; Bruno Gonçalves; Robert Z. Sumi; Stefan Boettcher (CoRR, 2008)

Geometric properties of satisfying assignments of random ε-1-in-k SAT - Gabriel Istrate (CoRR, 2008)

Adversarial Scheduling in Evolutionary Game Dynamics - Gabriel Istrate; Madhav V. Marathe; S. S. Ravi (CoRR, 2008)

Counting preimages of TCP reordering patterns. - Anders Hansson; Gabriel Istrate (Discret. Appl. Math., 2008)

On Hadwiger's Number of a graph with partial information - Gabriel Istrate (CoRR, 2009)

On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT). - Gabriel Istrate (Fundam. Informaticae, 2009)

Geometric properties of satisfying assignments of random epsilon-1-in-k SAT. - Gabriel Istrate (Int. J. Comput. Math., 2009)

Computational Complexity: A Conceptual Perspective by Oded Goldreich. - Gabriel Istrate (J. Artif. Soc. Soc. Simul., 2009)

Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) on hypergraphs - Gabriel Istrate (CoRR, 2011)

A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games - Cosmin Bonchis; Gabriel Istrate (CoRR, 2012)

Adversarial scheduling in discrete models of social dynamics. - Gabriel Istrate; Madhav V. Marathe; S. S. Ravi (Math. Struct. Comput. Sci., 2012)

Review of handbook of large-scale random networks by Bela Bollobás, Robert Kozma and Deszö Miklós. - Gabriel Istrate (SIGACT News, 2012)

Proof Complexity and the Kneser-Lovász Theorem. - Gabriel Istrate; Adrian Craciun (SAT, 2014)

Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games). - Cosmin Bonchis; Gabriel Istrate (CoRR, 2014)

Proof Complexity and the Kneser-Lovász Theorem (I). - Gabriel Istrate; Adrian Craciun (CoRR, 2014)

Learning Cover Context-Free Grammars from Structural Data. - Mircea Marin; Gabriel Istrate (Sci. Ann. Comput. Sci., 2014)

Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. - Cosmin Bonchis; Gabriel Istrate (Inf. Process. Lett., 2014)

Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process. - Gabriel Istrate; Cosmin Bonchis (CPM, 2015)

Identifying Almost Sorted Permutations from TCP Buffer Dynamics. - Gabriel Istrate (Sci. Ann. Comput. Sci., 2015)

Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs. - Gabriel Istrate (Theor. Comput. Sci., 2015)

Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. - Gabriel Istrate; Cosmin Bonchis (DCFS, 2016)

The Minimum Entropy Submodular Set Cover Problem. - Gabriel Istrate; Cosmin Bonchis; Liviu P. Dinu (LATA, 2016)

Computing a minimal partition of partial orders into heapable subsets. - János Balogh; Cosmin Bonchis; Diana Dinis; Gabriel Istrate (CoRR, 2017)

Stochastic Stability in Schelling's Segregation Model with Markovian Asynchronous Update. - Gabriel Istrate (ACRI, 2018)

The Language (and Series) of Hammersley-Type Processes. - Cosmin Bonchis; Gabriel Istrate; Vlad Rochian (MCU, 2018)

Short proofs of the Kneser-Lovász coloring principle. - James Aisenberg; Maria Luisa Bonet; Sam Buss; Adrian Craciun; Gabriel Istrate (Inf. Comput., 2018)

Attacking Power Indices by Manipulating Player Reliability. - Gabriel Istrate; Cosmin Bonchis; Alin Brîndusescu (AAMAS, 2019)

It's Not Whom You Know, It's What You (or Your Friends) Can Do: Succint Coalitional Frameworks for Network Centralities. - Gabriel Istrate; Cosmin Bonchis; Claudiu Gatina (CoRR, 2019)

Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm. - Gabriel Istrate; Cosmin Bonchis; Mircea Marin (CoRR, 2019)

It's Not Whom You Know, It's What You, or Your Friends, Can Do: Coalitional Frameworks for Network Centralities. - Gabriel Istrate; Cosmin Bonchis; Claudiu Gatina (AAMAS, 2020)

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. - Karthekeyan Chandrasekaran; Elena Grigorescu; Gabriel Istrate; Shubhang Kulkarni; Young-San Lin; Minshen Zhu (IPEC, 2020)

Game-theoretic Models of Moral and Other-Regarding Agents. - Gabriel Istrate (CoRR, 2020)

On the heapability of finite partial orders. - János Balogh; Cosmin Bonchis; Diana Dinis; Gabriel Istrate; Ioan Todinca (Discret. Math. Theor. Comput. Sci., 2020)

Models We Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation. - Gabriel Istrate (AAMAS, 2021)

Kernelization, Proof Complexity and Social Choice. - Gabriel Istrate; Cosmin Bonchis; Adrian Craciun (ICALP, 2021)

The Maximum Binary Tree Problem. - Karthekeyan Chandrasekaran; Elena Grigorescu; Gabriel Istrate; Shubhang Kulkarni; Young-San Lin; Minshen Zhu (Algorithmica, 2021)

Game-Theoretic Models of Moral and Other-Regarding Agents (extended abstract). - Gabriel Istrate (TARK, 2021)

Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. - Gabriel Istrate; Cosmin Bonchis (AAMAS, 2022)

Some Remarks on Almost Periodic Sequences and Languages. - Gabriel Istrate (CoRR, 2022)

Mechanism Design With Predictions for Obnoxious Facility Location. - Gabriel Istrate; Cosmin Bonchis (CoRR, 2022)

q-Overlaps in the Random Exact Cover Problem. - Gabriel Istrate; Romeo Negrea (FROM, 2023)

A parametric worst-case approach to fairness in cooperative games with transferable utility. - Gabriel Istrate; Cosmin Bonchis (Theor. Comput. Sci., 2023)

A Language-Theoretic Approach to the Heapability of Signed Permutations. - Gabriel Istrate (PSC, 2024)

Equilibria in multiagent online problems with predictions. - Gabriel Istrate; Cosmin Bonchis; Victor Bogdan (CoRR, 2024)

Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP). - Gabriel Istrate (FROM, 2024)

On multiagent online problems with predictions. - Gabriel Istrate; Cosmin Bonchis; Victor Bogdan (CoRR, 2025)