2009 |
41 | EE | Gabriel Istrate:
On Hadwiger's Number of a graph with partial information
CoRR abs/0903.2742: (2009) |
2008 |
40 | EE | Gabriel Istrate,
Madhav V. Marathe,
S. S. Ravi:
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion.
CiE 2008: 273-282 |
39 | EE | Gabriel Istrate,
Madhav V. Marathe,
S. S. Ravi:
Adversarial Scheduling Analysis of Game Theoretic Models of Norm Diffusion
CoRR abs/0803.2495: (2008) |
38 | EE | 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) |
37 | EE | Gabriel Istrate:
Identifying almost sorted permutations from TCP buffer dynamics
CoRR abs/0810.1639: (2008) |
36 | EE | Gabriel Istrate:
On the dynamics of Social Balance on general networks (with an application to XOR-SAT)
CoRR abs/0811.0381: (2008) |
35 | EE | Gabriel Istrate:
Geometric properties of satisfying assignments of random $\epsilon$-1-in-k SAT
CoRR abs/0811.3116: (2008) |
34 | EE | Gabriel Istrate,
Madhav V. Marathe,
S. S. Ravi:
Adversarial Scheduling in Evolutionary Game Dynamics
CoRR abs/0812.1194: (2008) |
33 | EE | Anders Hansson,
Gabriel Istrate:
Counting preimages of TCP reordering patterns.
Discrete Applied Mathematics 156(17): 3187-3193 (2008) |
2007 |
32 | EE | Anders Hansson,
Gabriel Istrate:
Counting preimages of TCP reordering patterns
CoRR abs/cs/0703020: (2007) |
31 | EE | Gabriel Istrate:
Satisfying assignments of Random Boolean CSP: Clusters and Overlaps
CoRR abs/cs/0703065: (2007) |
30 | EE | Gabriel Istrate:
Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps.
J. UCS 13(11): 1655-1670 (2007) |
29 | EE | Cristopher Moore,
Gabriel Istrate,
Demetrios D. Demopoulos,
Moshe Y. Vardi:
A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas.
Random Struct. Algorithms 31(2): 173-185 (2007) |
2006 |
28 | EE | Gabriel Istrate,
Anders Hansson,
Guanhua Yan:
Packet Reordering Metrics: Some Methodological Considerations.
ICNS 2006: 4 |
27 | EE | Gabriel Istrate,
Anders Hansson,
Sunil Thulasidasan,
Madhav V. Marathe,
Christopher L. Barrett:
Semantic Compression of TCP Traces.
Networking 2006: 123-135 |
26 | EE | 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 |
25 | EE | Anders Hansson,
Gabriel Istrate,
Shiva Prasad Kasiviswanathan:
Combinatorics of TCP reordering.
J. Comb. Optim. 12(1-2): 57-70 (2006) |
2005 |
24 | EE | Cristopher Moore,
Gabriel Istrate,
Demetrios D. Demopoulos,
Moshe Y. Vardi:
A Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas.
APPROX-RANDOM 2005: 414-425 |
23 | EE | Gabriel Istrate,
Stefan Boettcher,
Allon G. Percus:
Spines of random constraint satisfaction problems: definition and connection with computational complexity.
Ann. Math. Artif. Intell. 44(4): 353-372 (2005) |
22 | EE | Gabriel Istrate,
Stefan Boettcher,
Allon G. Percus:
Spines of Random Constraint Satisfaction Problems: Definition and Connection with Computational Complexity
CoRR abs/cs/0503082: (2005) |
21 | EE | Gabriel Istrate:
Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems
CoRR abs/cs/0503083: (2005) |
20 | EE | Gabriel Istrate:
Threshold properties of random boolean constraint satisfaction problems.
Discrete Applied Mathematics 153(1-3): 141-152 (2005) |
2004 |
19 | EE | Stefan Boettcher,
Gabriel Istrate,
Allon G. Percus:
Spines of Random Constraint Satisfaction Problems: Definition and Impact on Computational Complexity.
AMAI 2004 |
2002 |
18 | EE | Gabriel Istrate:
Phase Transitions and all that
CoRR cs.CC/0211012: (2002) |
17 | | Martin E. Dyer,
Leslie Ann Goldberg,
Catherine S. Greenhill,
Gabriel Istrate,
Mark Jerrum:
Convergence Of The Iterated Prisoner's Dilemma Game
Combinatorics, Probability & Computing 11(2): (2002) |
16 | EE | Gabriel Istrate:
The phase transition in random horn satisfiability and its algorithmic implications.
Random Struct. Algorithms 20(4): 483-506 (2002) |
2001 |
15 | EE | Gabriel Istrate,
Madhav V. Marathe,
S. S. Ravi:
Adversarial models in evolutionary game dynamics.
SODA 2001: 719-720 |
14 | EE | 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 |
13 | EE | Gabriel Istrate:
Computational Complexity and Phase Transitions.
IEEE Conference on Computational Complexity 2000: 104-115 |
12 | EE | Gabriel Istrate:
Computational Complexity and Phase Transitions
CoRR cs.CC/0005032: (2000) |
11 | EE | Gabriel Istrate:
Dimension-Dependent behavior in the satisfability of random k-Horn formulae
CoRR cs.DS/0007029: (2000) |
1999 |
10 | EE | Gabriel Istrate:
The Phase Transition in Random Horn Satisfiability and Its Algorithmic Implications.
SODA 1999: 925-926 |
9 | EE | Gabriel Istrate:
The phase transition in random Horn satisfiability and its algorithmic implications
CoRR cs.DS/9912001: (1999) |
8 | EE | Russell Bent,
Michael Schear,
Lane A. Hemaspaandra,
Gabriel Istrate:
On Bounded-Weight Error-Correcting Codes
CoRR cs.OH/9906001: (1999) |
7 | EE | Russell Bent,
Michael Schear,
Lane A. Hemaspaandra,
Gabriel Istrate:
A Note on Bounded-Weight Error-Correcting Codes.
J. UCS 5(12): 817-827 (1999) |
1997 |
6 | | Gabriel Istrate:
Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems.
CP 1997: 136-149 |
5 | EE | Gabriel Istrate:
The Strong Equivalence of ET0L Grammars.
Inf. Process. Lett. 62(4): 171-176 (1997) |
1994 |
4 | | Gabriel Istrate:
Self-reading sequences.
Discrete Applied Mathematics 50(2): 201-203 (1994) |
3 | EE | Gabriel Istrate,
Gheorghe Paun:
Some Combinatorial Properties of Self-reading Sequences.
Discrete Applied Mathematics 55(1): 83-86 (1994) |
1993 |
2 | | Gabriel Istrate:
The Strong Equivalence of ETOL Grammars.
Developments in Language Theory 1993: 81-89 |
1991 |
1 | | Cristian Calude,
Gabriel Istrate:
Determining and Stationary Sets for Some Classes of Partial Recursive Functions.
Theor. Comput. Sci. 82(1): 151-155 (1991) |