| Publication | Date of Publication | Type |
|---|
Game-theoretic models of moral and other-regarding agents (extended abstract)
| 2024-11-24 | Paper |
Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
| 2023-11-13 | Paper |
Stochastic Stability in Schelling’s Segregation Model with Markovian Asynchronous Update
Developments in Language Theory | 2023-06-30 | Paper |
A parametric worst-case approach to fairness in cooperative games with transferable utility
Theoretical Computer Science | 2023-04-20 | Paper |
The Maximum Binary Tree Problem.
| 2023-02-07 | Paper |
The maximum binary tree problem
Algorithmica | 2021-07-26 | Paper |
Kernelization, Proof Complexity and Social Choice
| 2021-04-28 | Paper |
On the heapability of finite partial orders
| 2021-01-05 | Paper |
Being Central on the Cheap: Stability in Heterogeneous Multiagent Centrality Games
| 2020-11-26 | Paper |
Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm
| 2019-09-26 | Paper |
Learning cover context-free grammars from structural data
Scientific Annals of Computer Science | 2019-02-08 | Paper |
Identifying Almost Sorted Permutations from TCP Buffer Dynamics
Scientific Annals of Computer Science | 2019-02-08 | Paper |
Gambler's ruin problem on Erdős-Rényi graphs
Physica A | 2018-11-13 | Paper |
The language (and series) of Hammersley-type processes
| 2018-06-26 | Paper |
Short proofs of the Kneser-Lovász coloring principle
Information and Computation | 2018-06-14 | Paper |
Two notes on generalized Darboux properties and related features of additive functions
| 2018-05-15 | Paper |
The language (and series) of Hammersley-type processes
| 2018-02-09 | Paper |
Heapability, interactive particle systems, partial orders: results and open problems
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
The strong equivalence of ET0L grammars
Information Processing Letters | 2016-05-26 | Paper |
The minimum entropy submodular set cover problem
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Short proofs of the Kneser-Lovász coloring principle
Automata, Languages, and Programming | 2015-11-04 | Paper |
Partition into heapable sequences, heap tableaux and a multiset extension of Hammersley's process
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Reachability and recurrence in a modular generalization of annihilating random walks (and Lights-Out games) to hypergraphs
Theoretical Computer Science | 2015-05-18 | Paper |
Learning Cover Context-Free Grammars from Structural Data
Theoretical Aspects of Computing – ICTAC 2014 | 2015-01-13 | Paper |
Proof Complexity and the Kneser-Lovász Theorem
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Improved approximation algorithms for low-density instances of the minimum entropy set cover problem
Information Processing Letters | 2014-04-17 | Paper |
Minimum Entropy Submodular Optimization (and Fairness in Cooperative Games)
| 2014-02-18 | Paper |
Adversarial scheduling in discrete models of social dynamics
MSCS. Mathematical Structures in Computer Science | 2012-10-23 | Paper |
Geometric properties of satisfying assignments of random ε-1-in-kSAT
International Journal of Computer Mathematics | 2010-01-15 | Paper |
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)
Fundamenta Informaticae | 2009-06-23 | Paper |
The peculiar phase structure of random graph bisection
Journal of Mathematical Physics | 2009-04-30 | Paper |
Introduction: where statistical physics meets computation
| 2009-02-09 | Paper |
Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion
Logic and Theory of Algorithms | 2008-06-19 | Paper |
A continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas
Random Structures \& Algorithms | 2008-01-08 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
Spines of random constraint satisfaction problems: definition and connection with computational complexity
Annals of Mathematics and Artificial Intelligence | 2006-01-23 | Paper |
Threshold properties of random Boolean constraint satisfaction problems
Discrete Applied Mathematics | 2006-01-10 | Paper |
scientific article; zbMATH DE number 2151254 (Why is no real title available?)
| 2005-04-04 | Paper |
Convergence of the Iterated Prisoner's Dilemma Game
Combinatorics, Probability and Computing | 2003-03-17 | Paper |
The phase transition in random horn satisfiability and its algorithmic implications
Random Structures \& Algorithms | 2002-08-08 | Paper |
Adversarial models in evolutionary game dynamics
| 2002-03-24 | Paper |
The phase transition in 1-in-\(k\) SAT and NAE 3-SAT
| 2002-01-30 | Paper |
On Bounded-Weight Error-Correcting Codes
| 2001-02-27 | Paper |
Some combinatorial properties of self-reading sequences
Discrete Applied Mathematics | 2000-08-01 | Paper |
scientific article; zbMATH DE number 1305521 (Why is no real title available?)
| 2000-02-02 | Paper |
Sums of continuous and Darboux functions
Real Analysis Exchange | 1995-01-01 | Paper |
Self-reading sequences
Discrete Applied Mathematics | 1994-11-29 | Paper |
Errata to: ``On two generalizations of the Darboux property
Real Analysis Exchange | 1994-06-16 | Paper |
RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS
Mathematical Logic Quarterly | 1994-06-08 | Paper |
On two generalizations of the Darboux property
Real Analysis Exchange | 1992-10-05 | Paper |
scientific article; zbMATH DE number 23839 (Why is no real title available?)
| 1992-06-26 | Paper |
Determining and stationary sets for some classes of partial recursive functions
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4193130 (Why is no real title available?)
| 1989-01-01 | Paper |
