The following pages link to Gabriel I. Istrate (Q1194654):
Displaying 46 items.
- (Q287051) (redirect page) (← links)
- The strong equivalence of ET0L grammars (Q287052) (← links)
- Determining and stationary sets for some classes of partial recursive functions (Q757357) (← links)
- Spines of random constraint satisfaction problems: definition and connection with computational complexity (Q812393) (← links)
- On two generalizations of the Darboux property (Q1194655) (← links)
- Errata to: ``On two generalizations of the Darboux property'' (Q1322612) (← links)
- Self-reading sequences (Q1326757) (← links)
- Some combinatorial properties of self-reading sequences (Q1337674) (← links)
- Gambler's ruin problem on Erdős-Rényi graphs (Q1620277) (← links)
- Short proofs of the Kneser-Lovász coloring principle (Q1641004) (← links)
- The language (and series) of Hammersley-type processes (Q1647315) (← links)
- Sums of continuous and Darboux functions (Q1898992) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs (Q2344774) (← links)
- Improved approximation algorithms for low-density instances of the minimum entropy set cover problem (Q2446594) (← links)
- Threshold properties of random Boolean constraint satisfaction problems (Q2581551) (← links)
- A parametric worst-case approach to fairness in cooperative games with transferable utility (Q2699972) (← links)
- (Q2768370) (← links)
- (Q2768371) (← links)
- The Minimum Entropy Submodular Set Cover Problem (Q2798728) (← links)
- Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems (Q2829966) (← links)
- Adversarial scheduling in discrete models of social dynamics (Q2919940) (← links)
- Learning Cover Context-Free Grammars from Structural Data (Q2938166) (← links)
- Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process (Q2942262) (← links)
- Convergence of the Iterated Prisoner's Dilemma Game (Q3147275) (← links)
- Proof Complexity and the Kneser-Lovász Theorem (Q3192060) (← links)
- (Q3210900) (← links)
- On the heapability of finite partial orders (Q3386613) (← links)
- Short Proofs of the Kneser-Lovász Coloring Principle (Q3449464) (← links)
- Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion (Q3507442) (← links)
- (Q3597147) (← links)
- The peculiar phase structure of random graph bisection (Q3624680) (← links)
- On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT) (Q3634003) (← links)
- (Q3982092) (← links)
- (Q4252413) (← links)
- RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS (Q4295226) (← links)
- On Bounded-Weight Error-Correcting Codes (Q4520803) (← links)
- The phase transition in random horn satisfiability and its algorithmic implications (Q4543632) (← links)
- Learning Cover Context-Free Grammars from Structural Data (Q4621183) (← links)
- Identifying Almost Sorted Permutations from TCP Buffer Dynamics (Q4621192) (← links)
- (Q4660724) (← links)
- A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas (Q5433256) (← links)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Q5479388) (← links)
- Geometric properties of satisfying assignments of random ε-1-in-<i>k</i>SAT (Q5850753) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree (Q6089651) (← links)
