NewEvery arXiv paper, its researchers & institutions — mapped.
papers

Publications (28)

math.PR2005

A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas

Cristopher Moore, Gabriel Istrate, Demetrios Demopoulos +1

cs.DS2014

Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games)

Cosmin Bonchiş, Gabriel Istrate

cs.GT2008

Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion

Gabriel Istrate, Madhav V. Marathe, S. S. Ravi

cs.FL2014

Learning cover context-free grammars from structural data

Mircea Marin, Gabriel Istrate

cs.CC2008

Geometric properties of satisfying assignments of random $ε$-1-in-k SAT

Gabriel Istrate

cs.DS2008

Identifying almost sorted permutations from TCP buffer dynamics

Gabriel Istrate

cs.DS2012

Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem

Cosmin Bonchis, Gabriel Istrate

math.CA2018

Two notes on generalized Darboux properties and related features of additive functions

Gabriel Istrate

math.LO2015

Short Proofs of the Kneser-Lovász Coloring Principle

James Aisenberg, Maria Luisa Bonet, Sam Buss +2

cs.DM2005

Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems

Gabriel Istrate

cs.CC2000

Computational Complexity and Phase Transitions

Gabriel Istrate

cs.IT1999

On Bounded-Weight Error-Correcting Codes

Russell Bent, Michael Schear, Lane A. Hemaspaandra +1

math.CO2013

Reachability and recurrence in a modular generalization of annihilating random walks (and lights-out games) on hypergraphs

Gabriel Istrate

cs.DS1999

The phase transition in random Horn satisfiability and its algorithmic implications

Gabriel Istrate

cs.CC2005

Phase Transitions and all that

Gabriel Istrate

math.CO2015

Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process

Gabriel Istrate, Cosmin Bonchis

cs.GT2012

A Parametric Worst-Case Approach to Fairness in TU-Cooperative Games

Cosmin Bonchis, Gabriel Istrate

cs.DM2008

On the dynamics of Social Balance on general networks (with an application to XOR-SAT)

Gabriel Istrate

cs.DM2009

On Hadwiger's Number of a graph with partial information

Gabriel Istrate

cs.GT2018

Stochastic Stability in Schelling's Segregation Model with Markovian Asynchronous Update

Gabriel Istrate

cs.CC2018

Proof Complexity and the Kneser-Lovász Theorem

Gabriel Istrate, Adrian Crăciun

cs.CC2005

Spines of Random Constraint Satisfaction Problems: Definition and Connection with Computational Complexity

Gabriel Istrate, Stefan Boettcher, Allon G. Percus

cs.FL2018

The language (and series) of Hammersley-type processes

Cosmin Bonchis, Gabriel Istrate, Vlad Rochian

cond-mat.stat-mech2008

The Peculiar Phase Structure of Random Graph Bisection

Allon G. Percus, Gabriel Istrate, Bruno Goncalves +2

cs.DM2008

Adversarial Scheduling in Evolutionary Game Dynamics

Gabriel Istrate, Madhav V. Marathe, S. S. Ravi

cs.DS2007

Counting preimages of TCP reordering patterns

Anders Hansson, Gabriel Istrate

cs.GT2019

Attacking Power Indices by Manipulating Player Reliability

Gabriel Istrate, Cosmin Bonchiş, Alin Brînduşescu

cs.DM2007

Satisfying assignments of Random Boolean CSP: Clusters and Overlaps

Gabriel Istrate