| Publication | Date of Publication | Type |
|---|
| Alternative proofs of the asymmetric Lovász local lemma and Shearer's lemma | 2024-10-31 | Paper |
Fugitive-search games on graphs and related parameters
Graph-Theoretic Concepts in Computer Science | 2024-01-05 | Paper |
Power consumption in packet radio networks (extended abstract)
Lecture Notes in Computer Science | 2022-11-09 | Paper |
| scientific article; zbMATH DE number 7561543 (Why is no real title available?) | 2022-07-21 | Paper |
| An Improved Bound of Acyclic Vertex-Coloring | 2021-11-03 | Paper |
On the computational complexity of non-dictatorial aggregation
Journal of Artificial Intelligence Research | 2021-10-05 | Paper |
Correction to: ``Directed Lovász local lemma and Shearer's lemma
Annals of Mathematics and Artificial Intelligence | 2021-06-25 | Paper |
| Algorithmically efficient syntactic characterization of possibility domains | 2020-11-05 | Paper |
Algorithmically efficient syntactic characterization of possibility domains
(available as arXiv preprint) | 2020-11-05 | Paper |
Directed Lovász local lemma and Shearer's lemma
Annals of Mathematics and Artificial Intelligence | 2020-02-11 | Paper |
An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects
Journal of Mathematical Imaging and Vision | 2019-09-23 | Paper |
On the algorithmic Lovász local lemma and acyclic edge coloring
2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Fast parallel constraint satisfaction
Automata, Languages and Programming | 2019-03-29 | Paper |
| The Acyclic Chromatic Index is Less than the Double of the Max Degree | 2019-01-23 | Paper |
On the computational complexity of non-dictatorial aggregation
(available as arXiv preprint) | 2018-11-08 | Paper |
Approximating the unsatisfiability threshold of random formulas (extended abstract)
Algorithms — ESA '96 | 2017-12-05 | Paper |
On the Computational Complexity of Non-dictatorial Aggregation
(available as arXiv preprint) | 2017-11-05 | Paper |
Aggregation of votes with multiple positions on each issue
Relational and Algebraic Methods in Computer Science | 2017-07-21 | Paper |
Acyclic edge coloring through the Lovász local lemma
Theoretical Computer Science | 2017-02-06 | Paper |
Partiality and approximation schemes for local consistency in networks of constraints
Lecture Notes in Computer Science | 2017-01-19 | Paper |
On the stability of generalized second price auctions with budgets
Theory of Computing Systems | 2016-09-21 | Paper |
| The probl\`eme des m\'enages revisited | 2016-07-14 | Paper |
| An alternative proof for the constructive Asymmetric Lov\'asz Local Lemma | 2015-05-11 | Paper |
On the stability of generalized second price auctions with budgets
Lecture Notes in Computer Science | 2014-03-31 | Paper |
| A new upper bound for 3-SAT | 2012-10-19 | Paper |
On the chromatic number of a random 5-regular graph
Journal of Graph Theory | 2009-12-18 | Paper |
On the satisfiability threshold of formulas with three literals per clause
Theoretical Computer Science | 2009-08-07 | Paper |
| scientific article; zbMATH DE number 5504155 (Why is no real title available?) | 2009-02-09 | Paper |
| scientific article; zbMATH DE number 5504156 (Why is no real title available?) | 2009-02-09 | Paper |
Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold
Lecture Notes in Computer Science | 2008-03-11 | Paper |
The unsatisfiability threshold revisited
Discrete Applied Mathematics | 2007-08-23 | Paper |
Selecting Complementary Pairs of Literals
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms | 2006-09-06 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
A dichotomy in the complexity of propositional circumscription
Theory of Computing Systems | 2005-02-24 | Paper |
The complexity of minimal satisfiability problems
Information and Computation | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2044510 (Why is no real title available?) | 2004-02-18 | Paper |
Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory
Networks | 2003-10-29 | Paper |
| scientific article; zbMATH DE number 1947423 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1884382 (Why is no real title available?) | 2003-03-18 | Paper |
Upper Bounds and Asymptotics for the q‐Binomial Coefficients
Studies in Applied Mathematics | 2002-12-11 | Paper |
Rigorous results for random (\(2+p)\)-SAT
Theoretical Computer Science | 2002-03-03 | Paper |
Random constraint satisfaction: A more accurate picture
Constraints | 2002-02-10 | Paper |
| scientific article; zbMATH DE number 1696681 (Why is no real title available?) | 2002-01-28 | Paper |
Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval
The Computer Journal. Section A Section B | 2002-01-23 | Paper |
| scientific article; zbMATH DE number 1688380 (Why is no real title available?) | 2002-01-09 | Paper |
| scientific article; zbMATH DE number 1629974 (Why is no real title available?) | 2001-10-23 | Paper |
| The unsatisfiability threshold revisited | 2001-09-24 | Paper |
On parallel partial solutions and approximation schemes for local consistency in networks of constraints
Constraints | 2000-09-04 | Paper |
Power consumption in packet radio networks
Theoretical Computer Science | 2000-08-21 | Paper |
A note on the non-colorability threshold of a random graph
The Electronic Journal of Combinatorics | 2000-06-07 | Paper |
A note on the non-colorability threshold of a random graph
The Electronic Journal of Combinatorics | 2000-06-07 | Paper |
| Approximating the unsatisfiability threshold of random formulas | 2000-05-03 | Paper |
| scientific article; zbMATH DE number 1346487 (Why is no real title available?) | 1999-10-04 | Paper |
Fugitive-search games on graphs and related parameters
Theoretical Computer Science | 1998-07-23 | Paper |
| scientific article; zbMATH DE number 1114008 (Why is no real title available?) | 1998-02-08 | Paper |
Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
Information Processing Letters | 1997-02-27 | Paper |
The Linkage of a Graph
SIAM Journal on Computing | 1996-10-15 | Paper |
Efficient algorithms for checking the atomicity of a run of read and write operations
Acta Informatica | 1995-06-21 | Paper |
Fast parallel constraint satisfaction
Artificial Intelligence | 1994-05-19 | Paper |
Parallel Complexity of the Connected Subgraph Problem
SIAM Journal on Computing | 1993-09-01 | Paper |
Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
Information and Computation | 1993-08-30 | Paper |
| scientific article; zbMATH DE number 176146 (Why is no real title available?) | 1993-05-18 | Paper |
The complexity of the reliable connectivity problem
Information Processing Letters | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4119595 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4062587 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4096767 (Why is no real title available?) | 1988-01-01 | Paper |
The complexity of recognizing polyhedral scenes
Journal of Computer and System Sciences | 1988-01-01 | Paper |
Searching and pebbling
Theoretical Computer Science | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3958768 (Why is no real title available?) | 1986-01-01 | Paper |
Interval graphs and searching
Discrete Mathematics | 1985-01-01 | Paper |
A selection theorem
Journal of Symbolic Logic | 1983-01-01 | Paper |
| A Generalized Kleene-Moschovakis Theorem | 1978-01-01 | Paper |
Improved bounds for acyclic coloring parameters
(available as arXiv preprint) | N/A | Paper |
