Gabriel Istrate
Association for Computing Machinery
83 Papers
270 Citations
Gabriel Istrate is an academic researcher from Association for Computing Machinery. The author has contributed to research in topics: Satisfiability & Constraint satisfaction problem. The author has an hindex of 9, co-authored 78 publications. Previous affiliations of Gabriel Istrate include Babeș-Bolyai University & Romanian Academy of Sciences.
Chat about Author
Papers
A continuous–discontinuous second-order transition in the satisfiability of random Horn-SAT formulas
TL;DR: This work compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata, and finds the first case in which a phase transition of this type has been rigorously established for a random constraint satisfaction problem.
•Book
Computational Complexity and Statistical Physics
Allon G. Percus,Gabriel Istrate,Cristopher Moore +2 more
- 23 Feb 2006
TL;DR: Computational Complexity and Statistical Physics will serve as a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems.
197
Strong edge coloring for channel assignment in wireless radio networks
Christopher L. Barrett,Gabriel Istrate,V.S.A. Kumar,Madhav V. Marathe,Shripad Thite,Sunil Thulasidasan +5 more
- 13 Mar 2006
TL;DR: Efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks are given that are equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network.
Convergence of the Iterated Prisoner's Dilemma Game
TL;DR: A stochastic process based on the iterated prisoner's dilemma game, where each player has a state, and the states of the players connected by the edge are modified according to the Pavlov strategy, which converges to a unique absorbing state in which all players cooperate.
Looking for a Version of Schaefer''s Dichotomy Theorem When Each Variable Occurs at Most Twice
Gabriel Istrate
- 01 Mar 1997
TL;DR: In this paper, the authors study the possibility to obtain a version of Schaefer''s dichotomy theorem for instances satisfying an additional constraint, namely each variable appears at most twice.
23