default search action
Gabriel Istrate
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c32]Gabriel Istrate:
A Language-Theoretic Approach to the Heapability of Signed Permutations. PSC 2024: 71-85 - [c31]Gabriel Istrate:
Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other problems in NP). FROM 2024: 38-52 - [i40]Gabriel Istrate, Cosmin Bonchis, Victor Bogdan:
Equilibria in multiagent online problems with predictions. CoRR abs/2405.11873 (2024) - [i39]Gabriel Istrate:
A Language-Theoretic Approach to the Heapability of Signed Permutations. CoRR abs/2405.14275 (2024) - 2023
- [j28]Gabriel Istrate, Cosmin Bonchis:
A parametric worst-case approach to fairness in cooperative games with transferable utility. Theor. Comput. Sci. 940(Part): 189-205 (2023) - [c30]Gabriel Istrate, Romeo Negrea:
q-Overlaps in the Random Exact Cover Problem. FROM 2023: 26-40 - 2022
- [c29]Gabriel Istrate, Cosmin Bonchis:
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. AAMAS 2022: 651-659 - [i38]Gabriel Istrate:
Some Remarks on Almost Periodic Sequences and Languages. CoRR abs/2211.14613 (2022) - [i37]Gabriel Istrate, Cosmin Bonchis:
Mechanism Design With Predictions for Obnoxious Facility Location. CoRR abs/2212.09521 (2022) - 2021
- [j27]Karthekeyan Chandrasekaran
, Elena Grigorescu
The Maximum Binary Tree Problem. Algorithmica 83(8): 2427-2468 (2021) - [c28]Gabriel Istrate:
Models We Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation. AAMAS 2021: 6-11 - [c27]Gabriel Istrate, Cosmin Bonchis, Adrian Craciun:
Kernelization, Proof Complexity and Social Choice. ICALP 2021: 135:1-135:21 - [c26]Gabriel Istrate:
Game-Theoretic Models of Moral and Other-Regarding Agents (extended abstract). TARK 2021: 213-227 - [i36]Gabriel Istrate:
Models we Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation. CoRR abs/2102.11615 (2021) - [i35]Gabriel Istrate, Cosmin Bonchis, Adrian Craciun:
Kernelization, Proof Complexity and Social Choice. CoRR abs/2104.13681 (2021) - [i34]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 abs/2110.00495 (2021) - 2020
- [j26]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) - [c25]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: 566-574 - [c24]Karthekeyan Chandrasekaran, Elena Grigorescu
The Maximum Binary Tree Problem. ESA 2020: 30:1-30:22 - [c23]Karthekeyan Chandrasekaran, Elena Grigorescu
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree. IPEC 2020: 7:1-7:16 - [i33]Gabriel Istrate, Cosmin Bonchis:
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games. CoRR abs/2011.13163 (2020) - [i32]Gabriel Istrate:
Game-theoretic Models of Moral and Other-Regarding Agents. CoRR abs/2012.09759 (2020)
2010 – 2019
- 2019
- [c22]Gabriel Istrate, Cosmin Bonchis, Alin Brîndusescu:
Attacking Power Indices by Manipulating Player Reliability. AAMAS 2019: 538-546 - [i31]Gabriel Istrate, Cosmin Bonchis, Alin Brîndusescu:
Attacking Power Indices by Manipulating Player Reliability. CoRR abs/1903.01165 (2019) - [i30]Karthekeyan Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu:
The Maximum Binary Tree Problem. CoRR abs/1909.07915 (2019) - [i29]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 abs/1909.11084 (2019) - [i28]Gabriel Istrate, Cosmin Bonchis, Mircea Marin:
Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm. CoRR abs/1909.12353 (2019) - 2018
- [j25]James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun
Short proofs of the Kneser-Lovász coloring principle. Inf. Comput. 261: 296-310 (2018) - [c21]Gabriel Istrate:
Stochastic Stability in Schelling's Segregation Model with Markovian Asynchronous Update. ACRI 2018: 416-427 - [c20]Cosmin Bonchis, Gabriel Istrate, Vlad Rochian:
The Language (and Series) of Hammersley-Type Processes. MCU 2018: 69-87 - [i27]Cosmin Bonchis, Gabriel Istrate, Vlad Rochian:
The language (and series) of Hammersley-type processes. CoRR abs/1802.03436 (2018) - [i26]Gabriel Istrate:
Stochastic Stability in Schelling's Segregation Model with Markovian Asynchronous Update. CoRR abs/1807.05419 (2018) - 2017
- [i25]János Balogh, Cosmin Bonchis, Diana Dinis, Gabriel Istrate:
Computing a minimal partition of partial orders into heapable subsets. CoRR abs/1706.01230 (2017) - 2016
- [c19]Gabriel Istrate, Cosmin Bonchis:
Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems. DCFS 2016: 18-28 - [c18]Gabriel Istrate, Cosmin Bonchis, Liviu P. Dinu:
The Minimum Entropy Submodular Set Cover Problem. LATA 2016: 295-306 - 2015
- [j24]Gabriel Istrate:
Identifying Almost Sorted Permutations from TCP Buffer Dynamics. Sci. Ann. Comput. Sci. 25(1): 133-154 (2015) - [j23]Gabriel Istrate:
Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) to hypergraphs. Theor. Comput. Sci. 580: 83-93 (2015) - [c17]Gabriel Istrate, Cosmin Bonchis:
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process. CPM 2015: 261-271 - [c16]James Aisenberg, Maria Luisa Bonet
Short Proofs of the Kneser-Lovász Coloring Principle. ICALP (2) 2015: 44-55 - [i24]Gabriel Istrate, Cosmin Bonchis:
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process. CoRR abs/1502.02045 (2015) - [i23]James Aisenberg, Maria Luisa Bonet, Sam Buss, Adrian Craciun, Gabriel Istrate:
Short Proofs of the Kneser-Lovász Coloring Principle. CoRR abs/1505.05531 (2015) - 2014
- [j22]Mircea Marin
Learning Cover Context-Free Grammars from Structural Data. Sci. Ann. Comput. Sci. 24(2): 253-286 (2014) - [j21]Cosmin Bonchis, Gabriel Istrate:
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. Inf. Process. Lett. 114(7): 360-364 (2014) - [c15]Mircea Marin, Gabriel Istrate:
Learning Cover Context-Free Grammars from Structural Data. ICTAC 2014: 241-258 - [c14]Gabriel Istrate, Adrian Craciun
Proof Complexity and the Kneser-Lovász Theorem. SAT 2014: 138-153 - [i22]Gabriel Istrate, Adrian Craciun:
Proof Complexity and the Kneser-Lovász Theorem (I). CoRR abs/1402.4338 (2014) - [i21]Cosmin Bonchis, Gabriel Istrate:
Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games). CoRR abs/1402.4343 (2014) - [i20]Mircea Marin, Gabriel Istrate:
Learning cover context-free grammars from structural data. CoRR abs/1404.2409 (2014) - 2012
- [j20]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial scheduling in discrete models of social dynamics. Math. Struct. Comput. Sci. 22(5): 788-815 (2012) - [j19]Gabriel Istrate:
Review of handbook of large-scale random networks by Bela Bollobás, Robert Kozma and Deszö Miklós. SIGACT News 43(2): 25-28 (2012) - [i19]Cosmin Bonchis, Gabriel Istrate:
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. CoRR abs/1207.7134 (2012) - [i18]Cosmin Bonchis, Gabriel Istrate:
A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games. CoRR abs/1208.0283 (2012) - 2011
- [i17]Gabriel Istrate:
Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) on hypergraphs. CoRR abs/1102.1440 (2011)
2000 – 2009
- 2009
- [j18]Gabriel Istrate:
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT). Fundam. Informaticae 91(2): 341-356 (2009) - [j17]Gabriel Istrate:
Geometric properties of satisfying assignments of random epsilon-1-in-k SAT. Int. J. Comput. Math. 86(12): 2029-2039 (2009) - [j16]Gabriel Istrate:
Computational Complexity: A Conceptual Perspective by Oded Goldreich. J. Artif. Soc. Soc. Simul. 12(4) (2009) - [i16]Gabriel Istrate:
On Hadwiger's Number of a graph with partial information. CoRR abs/0903.2742 (2009) - 2008
- [j15]Anders Hansson, Gabriel Istrate:
Counting preimages of TCP reordering patterns. Discret. Appl. Math. 156(17): 3187-3193 (2008) - [c13]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion. CiE 2008: 273-282 - [i15]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion. CoRR abs/0803.2495 (2008) - [i14]Allon G. Percus, Gabriel Istrate, Bruno Gonçalves, Robert Z. Sumi, Stefan Boettcher:
The Peculiar Phase Structure of Random Graph Bisection. CoRR abs/0808.1549 (2008) - [i13]Gabriel Istrate:
Identifying almost sorted permutations from TCP buffer dynamics. CoRR abs/0810.1639 (2008) - [i12]Gabriel Istrate:
On the dynamics of Social Balance on general networks (with an application to XOR-SAT). CoRR abs/0811.0381 (2008) - [i11]Gabriel Istrate:
Geometric properties of satisfying assignments of random ε-1-in-k SAT. CoRR abs/0811.3116 (2008) - [i10]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial Scheduling in Evolutionary Game Dynamics. CoRR abs/0812.1194 (2008) - 2007
- [j14]Gabriel Istrate:
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps. J. Univers. Comput. Sci. 13(11): 1655-1670 (2007) - [j13]Cristopher Moore
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas. Random Struct. Algorithms 31(2): 173-185 (2007) - [i9]Anders Hansson, Gabriel Istrate:
Counting preimages of TCP reordering patterns. CoRR abs/cs/0703020 (2007) - [i8]Gabriel Istrate:
Satisfying assignments of Random Boolean CSP: Clusters and Overlaps. CoRR abs/cs/0703065 (2007) - 2006
- [j12]Anders Hansson, Gabriel Istrate, Shiva Prasad Kasiviswanathan:
Combinatorics of TCP reordering. J. Comb. Optim. 12(1-2): 57-70 (2006) - [c12]Gabriel Istrate, Anders Hansson, Guanhua Yan:
Packet Reordering Metrics: Some Methodological Considerations. ICNS 2006: 4 - [c11]Gabriel Istrate, Anders Hansson, Sunil Thulasidasan, Madhav V. Marathe, Christopher L. Barrett:
Semantic Compression of TCP Traces. Networking 2006: 123-135 - [c10]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: 106-110 - [p1]Allon G. Percus, Gabriel Istrate, Cristopher Moore:
Introduction: Where Statistical Physics Mects Computation. Computational Complexity and Statistical Physics 2006: 3-24 - [e1]Allon G. Percus, Gabriel Istrate, Cristopher Moore:
Computational Complexity and Statistical Physics. Santa Fe Institute Studies in the Sciences of Complexity, Oxford University Press 2006, ISBN 978-0-19-517738-1 [contents] - 2005
- [j11]Gabriel Istrate, Stefan Boettcher
Spines of random constraint satisfaction problems: definition and connection with computational complexity. Ann. Math. Artif. Intell. 44(4): 353-372 (2005) - [j10]Gabriel Istrate:
Threshold properties of random boolean constraint satisfaction problems. Discret. Appl. Math. 153(1-3): 141-152 (2005) - [c9]Cristopher Moore
A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas. APPROX-RANDOM 2005: 414-425 - [i7]Gabriel Istrate, Stefan Boettcher, Allon G. Percus:
Spines of Random Constraint Satisfaction Problems: Definition and Connection with Computational Complexity. CoRR abs/cs/0503082 (2005) - [i6]Gabriel Istrate:
Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems. CoRR abs/cs/0503083 (2005) - 2004
- [c8]Stefan Boettcher, Gabriel Istrate, Allon G. Percus:
Spines of Random Constraint Satisfaction Problems: Definition and Impact on Computational Complexity. AI&M 2004 - 2002
- [j9]Martin E. Dyer
Convergence Of The Iterated Prisoner's Dilemma Game. Comb. Probab. Comput. 11(2): 135-147 (2002) - [j8]Gabriel Istrate:
The phase transition in random horn satisfiability and its algorithmic implications. Random Struct. Algorithms 20(4): 483-506 (2002) - [i5]Gabriel Istrate:
Phase Transitions and all that. CoRR cs.CC/0211012 (2002) - 2001
- [c7]Gabriel Istrate:
On the Satisfiability of Random k-Horn Formulae. Graphs, Morphisms and Statistical Physics 2001: 113-136 - [c6]Gabriel Istrate, Madhav V. Marathe, S. S. Ravi:
Adversarial models in evolutionary game dynamics. SODA 2001: 719-720 - [c5]Dimitris Achlioptas, Arthur D. Chtcherba, Gabriel Istrate, Cristopher Moore:
The phase transition in 1-in-k SAT and NAE 3-SAT. SODA 2001: 721-722 - 2000
- [j7]Gabriel Istrate:
Review of Parameterized Complexity by R. Downey and M. Fellows. SIGACT News 31(4): 13-15 (2000) - [c4]Gabriel Istrate:
Computational Complexity and Phase Transitions. CCC 2000: 104-115 - [i4]Gabriel Istrate:
Computational Complexity and Phase Transitions. CoRR cs.CC/0005032 (2000) - [i3]Gabriel Istrate:
Dimension-Dependent behavior in the satisfability of random k-Horn formulae. CoRR cs.DS/0007029 (2000)
1990 – 1999
- 1999
- [j6]Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate:
A Note on Bounded-Weight Error-Correcting Codes. J. Univers. Comput. Sci. 5(12): 817-827 (1999) - [c3]Gabriel Istrate:
The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications. SODA 1999: 925-926 - [i2]Gabriel Istrate:
The phase transition in random Horn satisfiability and its algorithmic implications. CoRR cs.DS/9912001 (1999) - [i1]Russell Bent, Michael Schear, Lane A. Hemaspaandra, Gabriel Istrate:
On Bounded-Weight Error-Correcting Codes. CoRR cs.OH/9906001 (1999) - 1997
- [j5]Gabriel Istrate:
The Strong Equivalence of ET0L Grammars. Inf. Process. Lett. 62(4): 171-176 (1997) - [c2]Gabriel Istrate:
Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems. CP 1997: 136-149 - 1994
- [j4]Gabriel Istrate:
Self-reading sequences. Discret. Appl. Math. 50(2): 201-203 (1994) - [j3]Gabriel Istrate, Gheorghe Paun:
Some Combinatorial Properties of Self-reading Sequences. Discret. Appl. Math. 55(1): 83-86 (1994) - 1993
- [c1]Gabriel Istrate:
The Strong Equivalence of ETOL Grammars. Developments in Language Theory 1993: 81-89 - 1992
- [j2]Cristian S. Calude, Gabriel Istrate, Marius Zimand:
Recursive Baire Classification and Speedable Functions. Math. Log. Q. 38(1): 169-178 (1992) - 1991
- [j1]Cristian Calude
Determining and Stationary Sets for Some Classes of Partial Recursive Functions. Theor. Comput. Sci. 82(1): 151-155 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: