Gabriel Istrate

Theor. Comput. Sci., 2023

q-Overlaps in the Random Exact Cover Problem.

[BibT_eX]

[DOI]

Romeo Negrea

Proceedings of the Proceedings 7th Symposium on Working Formal Methods, 2023

2022

Mechanism Design With Predictions for Obnoxious Facility Location.

[BibT_eX]

[DOI]

CoRR, 2022

Some Remarks on Almost Periodic Sequences and Languages.

[BibT_eX]

[DOI]

CoRR, 2022

Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021

Game-Theoretic Models of Moral and Other-Regarding Agents (extended abstract).

[BibT_eX]

[DOI]

Karthekeyan Chandrasekaran

Proceedings of the Proceedings Eighteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2021

The Maximum Binary Tree Problem.

[BibT_eX]

[DOI]

Algorithmica, 2021

Kernelization, Proof Complexity and Social Choice.

[BibT_eX]

[DOI]

Adrian Craciun

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

Models We Can Trust: Toward a Systematic Discipline of (Agent-Based) Model Interpretation and Validation.

[BibT_eX]

[DOI]

Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2020

On the heapability of finite partial orders.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

Game-theoretic Models of Moral and Other-Regarding Agents.

[BibT_eX]

[DOI]

Karthekeyan Chandrasekaran

CoRR, 2020

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

It's Not Whom You Know, It's What You, or Your Friends, Can Do: Coalitional Frameworks for Network Centralities.

[BibT_eX]

[DOI]

Claudiu Gatina

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm.

[BibT_eX]

[DOI]

Mircea Marin

CoRR, 2019

It's Not Whom You Know, It's What You (or Your Friends) Can Do: Succint Coalitional Frameworks for Network Centralities.

[BibT_eX]

[DOI]

Claudiu Gatina

CoRR, 2019

Attacking Power Indices by Manipulating Player Reliability.

[BibT_eX]

[DOI]

Alin Brîndusescu

Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, 2019

2018

Short proofs of the Kneser-Lovász coloring principle.

[BibT_eX]

[DOI]

Inf. Comput., 2018

The Language (and Series) of Hammersley-Type Processes.

[BibT_eX]

[DOI]

Vlad Rochian

Proceedings of the Machines, Computations, and Universality - 8th International Conference, 2018

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

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata, 2018

2017

Computing a minimal partition of partial orders into heapable subsets.

[BibT_eX]

[DOI]

CoRR, 2017

2016

The Minimum Entropy Submodular Set Cover Problem.

[BibT_eX]

[DOI]

Liviu P. Dinu

Proceedings of the Language and Automata Theory and Applications, 2016

Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Identifying Almost Sorted Permutations from TCP Buffer Dynamics.

[BibT_eX]

[DOI]

Sci. Ann. Comput. Sci., 2015

Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley's Process.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

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

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

Learning Cover Context-Free Grammars from Structural Data.

[BibT_eX]

[DOI]

Mircea Marin

Sci. Ann. Comput. Sci., 2014

Proof Complexity and the Kneser-Lovász Theorem (I).

[BibT_eX]

[DOI]

Adrian Craciun

CoRR, 2014

Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games).

[BibT_eX]

[DOI]

CoRR, 2014

Proof Complexity and the Kneser-Lovász Theorem.

[BibT_eX]

[DOI]

Adrian Craciun

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2012

Review of handbook of large-scale random networks by Bela Bollobás, Robert Kozma and Deszö Miklós.

[BibT_eX]

[DOI]

SIGACT News, 2012

Adversarial scheduling in discrete models of social dynamics.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2012

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

[BibT_eX]

[DOI]

CoRR, 2012

2011

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

[BibT_eX]

[DOI]

CoRR, 2011

2009

Computational Complexity: A Conceptual Perspective <i>by Oded Goldreich</i>.

[BibT_eX]

[DOI]

J. Artif. Soc. Soc. Simul., 2009

Geometric properties of satisfying assignments of random epsilon-1-in-<i>k</i> SAT.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2009

On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT).

[BibT_eX]

[DOI]

Fundam. Informaticae, 2009

On Hadwiger's Number of a graph with partial information

[BibT_eX]

[DOI]

CoRR, 2009

2008

Counting preimages of TCP reordering patterns.

[BibT_eX]

[DOI]

Anders Hansson

Discret. Appl. Math., 2008

Adversarial Scheduling in Evolutionary Game Dynamics

[BibT_eX]

[DOI]

CoRR, 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

The Peculiar Phase Structure of Random Graph Bisection

[BibT_eX]

[DOI]

CoRR, 2008

Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion.

[BibT_eX]

[DOI]

Proceedings of the Logic and Theory of Algorithms, 2008

2007

A continuous-discontinuous second-order transition in the satisfiability of random Horn-SAT formulas.

[BibT_eX]

[DOI]

Cristopher Moore

Demetrios D. Demopoulos

Moshe Y. Vardi

Random Struct. Algorithms, 2007

Satisfying Assignments of Random Boolean Constraint Satisfaction Problems: Clusters and Overlaps.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2007

Satisfying assignments of Random Boolean CSP: Clusters and Overlaps

[BibT_eX]

[DOI]

CoRR, 2007

2006

Combinatorics of TCP reordering.

[BibT_eX]

[DOI]

Anders Hansson

Shiva Prasad Kasiviswanathan

J. Comb. Optim., 2006

Strong Edge Coloring for Channel Assignment in Wireless Radio Networks.

[BibT_eX]

[DOI]

Christopher L. Barrett

Proceedings of the 4th IEEE Conference on Pervasive Computing and Communications Workshops (PerCom 2006 Workshops), 2006

Semantic Compression of TCP Traces.

[BibT_eX]

[DOI]

Christopher L. Barrett

Proceedings of the NETWORKING 2006, 2006

Packet Reordering Metrics: Some Methodological Considerations.

[BibT_eX]

[DOI]

Anders Hansson

Guanhua Yan

Proceedings of the 2006 International Conference on Networking and Services (ICNS 2006), 2006

Introduction: Where Statistical Physics Mects Computation.

[BibT_eX]

Allon G. Percus

Cristopher Moore

Proceedings of the Computational Complexity and Statistical Physics., 2006

2005

Threshold properties of random boolean constraint satisfaction problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems

[BibT_eX]

[DOI]

CoRR, 2005

Spines of random constraint satisfaction problems: definition and connection with computational complexity.

[BibT_eX]

[DOI]

Stefan Boettcher

Allon G. Percus

Ann. Math. Artif. Intell., 2005

2004

Spines of Random Constraint Satisfaction Problems: Definition and Impact on Computational Complexity.

[BibT_eX]

[DOI]

Stefan Boettcher

Allon G. Percus

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

2002

The phase transition in random horn satisfiability and its algorithmic implications.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

Convergence Of The Iterated Prisoner's Dilemma Game.

[BibT_eX]

[DOI]

Martin E. Dyer

Leslie Ann Goldberg

Catherine S. Greenhill

Mark Jerrum

Comb. Probab. Comput., 2002

Phase Transitions and all that

[BibT_eX]

[DOI]

CoRR, 2002

2001

Adversarial models in evolutionary game dynamics.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

The phase transition in 1-in-k SAT and NAE 3-SAT.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

On the Satisfiability of Random k-Horn Formulae.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

Review of Parameterized Complexity by R. Downey and M. Fellows.

[BibT_eX]

[DOI]

SIGACT News, 2000

Dimension-Dependent behavior in the satisfability of random k-Horn formulae

[BibT_eX]

[DOI]

CoRR, 2000

Computational Complexity and Phase Transitions.

[BibT_eX]

[DOI]

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

1999

A Note on Bounded-Weight Error-Correcting Codes.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1999

On Bounded-Weight Error-Correcting Codes

[BibT_eX]

[DOI]

CoRR, 1999

1997

The Strong Equivalence of ET0L Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1994

Some Combinatorial Properties of Self-reading Sequences.

[BibT_eX]

[DOI]

Gheorghe Paun

Discret. Appl. Math., 1994

Self-reading sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

The Strong Equivalence of ETOL Grammars.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1992

Recursive Baire Classification and Speedable Functions.

[BibT_eX]

[DOI]

Cristian S. Calude

Marius Zimand

Math. Log. Q., 1992

1991

Determining and Stationary Sets for Some Classes of Partial Recursive Functions.

[BibT_eX]

[DOI]

Cristian Calude