Gabriel Istrate

103 papers A* 4A 8B 4C 5Misc 1Journal 69Unranked 10

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