| 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 | 2024-01-05 | Paper |
| Power consumption in packet radio networks (extended abstract) | 2022-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091205 | 2022-07-21 | Paper |
| An Improved Bound of Acyclic Vertex-Coloring | 2021-11-03 | Paper |
| On the computational complexity of non-dictatorial aggregation | 2021-10-05 | Paper |
| Correction to: ``Directed Lovász local lemma and Shearer's lemma | 2021-06-25 | Paper |
| Algorithmically efficient syntactic characterization of possibility domains | 2020-11-05 | Paper |
| Directed Lovász local lemma and Shearer's lemma | 2020-02-11 | Paper |
| An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects | 2019-09-23 | Paper |
| On the algorithmic Lovász local lemma and acyclic edge coloring | 2019-09-17 | Paper |
| Fast parallel constraint satisfaction | 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 | 2018-11-08 | Paper |
| Approximating the unsatisfiability threshold of random formulas (extended abstract) | 2017-12-05 | Paper |
| On the Computational Complexity of Non-dictatorial Aggregation | 2017-11-05 | Paper |
| Aggregation of votes with multiple positions on each issue | 2017-07-21 | Paper |
| Acyclic edge coloring through the Lovász local lemma | 2017-02-06 | Paper |
| Partiality and approximation schemes for local consistency in networks of constraints | 2017-01-19 | Paper |
| On the stability of generalized second price auctions with budgets | 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 | 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 | 2009-12-18 | Paper |
| On the satisfiability threshold of formulas with three literals per clause | 2009-08-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597153 | 2009-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3597154 | 2009-02-09 | Paper |
| Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold | 2008-03-11 | Paper |
| The unsatisfiability threshold revisited | 2007-08-23 | Paper |
| Selecting Complementary Pairs of Literals | 2007-05-29 | Paper |
| The probabilistic analysis of a greedy satisfiability algorithm | 2006-09-06 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| A dichotomy in the complexity of propositional circumscription | 2005-02-24 | Paper |
| The complexity of minimal satisfiability problems | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448374 | 2004-02-18 | Paper |
| Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory | 2003-10-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411392 | 2003-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4799291 | 2003-03-18 | Paper |
| Upper Bounds and Asymptotics for the q‐Binomial Coefficients | 2002-12-11 | Paper |
| Rigorous results for random (\(2+p)\)-SAT | 2002-03-03 | Paper |
| Random constraint satisfaction: A more accurate picture | 2002-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766883 | 2002-01-28 | Paper |
| Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval | 2002-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762521 | 2002-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2729093 | 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 | 2000-09-04 | Paper |
| Power consumption in packet radio networks | 2000-08-21 | Paper |
| A note on the non-colorability threshold of a random graph | 2000-06-07 | Paper |
| Approximating the unsatisfiability threshold of random formulas | 2000-05-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266508 | 1999-10-04 | Paper |
| Fugitive-search games on graphs and related parameters | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375776 | 1998-02-08 | Paper |
| Simple atomic snapshots: A linear complexity solution with unbounded time-stamps | 1997-02-27 | Paper |
| The Linkage of a Graph | 1996-10-15 | Paper |
| Efficient algorithms for checking the atomicity of a run of read and write operations | 1995-06-21 | Paper |
| Fast parallel constraint satisfaction | 1994-05-19 | Paper |
| Parallel Complexity of the Connected Subgraph Problem | 1993-09-01 | Paper |
| Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays | 1993-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035248 | 1993-05-18 | Paper |
| The complexity of the reliable connectivity problem | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733379 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796746 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3823129 | 1988-01-01 | Paper |
| The complexity of recognizing polyhedral scenes | 1988-01-01 | Paper |
| Searching and pebbling | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3727416 | 1986-01-01 | Paper |
| Interval graphs and searching | 1985-01-01 | Paper |
| A selection theorem | 1983-01-01 | Paper |
| A Generalized Kleene-Moschovakis Theorem | 1978-01-01 | Paper |
| Improved bounds for acyclic coloring parameters | N/A | Paper |
