| Publication | Date of Publication | Type |
|---|
| The join can lower complexity | 2024-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6084358 | 2023-10-31 | Paper |
| On the complexity of small description and related topics | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5005153 | 2021-08-04 | Paper |
| The robustness of LWPP and WPP, with an application to graph reconstruction | 2021-05-25 | Paper |
| Space efficient separator algorithms for planar graphs | 2020-07-22 | Paper |
| On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets | 2020-07-20 | Paper |
| An improvement of the algorithm of Hertli for the unique 3SAT problem | 2020-01-16 | Paper |
| Message Passing Algorithms for MLS-3LIN Problem | 2019-09-17 | Paper |
| Polynomial size linear programs for problems in \textsc{P} | 2019-07-17 | Paper |
| New collapse consequences of NP having small circuits | 2019-01-10 | Paper |
| An improvement of the algorithm of Hertli for the unique 3SAT problem | 2018-06-15 | Paper |
| On the optimality of lattices for the Coppersmith technique | 2018-04-18 | Paper |
| The query complexity of witness finding | 2017-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5368752 | 2017-10-10 | Paper |
| Local restrictions from the Furst-Saxe-Sipser paper | 2017-03-31 | Paper |
| A short implicant of a CNF formula with many satisfying assignments | 2016-12-21 | Paper |
| Relating Sublinear Space Computability Among Graph Connectivity and Related Problems | 2016-03-10 | Paper |
| A Short Implicant of a CNF Formula with Many Satisfying Assignments | 2015-09-11 | Paper |
| On the Limit of Some Algorithmic Approach to Circuit Lower Bounds | 2015-09-08 | Paper |
| Interval graph representation with given interval and intersection lengths | 2015-08-24 | Paper |
| $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability | 2014-10-14 | Paper |
| The Query Complexity of Witness Finding | 2014-06-24 | Paper |
| A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques | 2013-11-28 | Paper |
| Message passing algorithms for MLS-3LIN problem | 2013-11-11 | Paper |
| Is Valiant-Vazirani's isolation probability improvable? | 2013-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2838176 | 2013-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2838185 | 2013-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2838197 | 2013-07-09 | Paper |
| Interval Graph Representation with Given Interval and Intersection Lengths | 2013-03-21 | Paper |
| On the Optimality of Lattices for the Coppersmith Technique | 2012-09-07 | Paper |
| Propagation connectivity of random hypergraphs | 2012-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3224099 | 2012-03-29 | Paper |
| On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results | 2011-03-18 | Paper |
| Weighted random popular matchings | 2010-12-14 | Paper |
| Propagation Connectivity of Random Hypergraphs | 2010-09-10 | Paper |
| Average-case analysis for the MAX-2SAT problem | 2010-04-15 | Paper |
| A New Model for a Scale-Free Hierarchical Structure of Isolated Cliques | 2010-02-09 | Paper |
| On the complexity of kings | 2010-02-09 | Paper |
| Scale free interval graphs | 2009-11-04 | Paper |
| Finding most likely solutions | 2009-10-19 | Paper |
| Substring search and repeat search using factor oracles | 2009-08-27 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Relativized collapsing between BPP and PH under stringent oracle access | 2009-07-21 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2009-05-26 | Paper |
| Scale Free Interval Graphs | 2008-07-10 | Paper |
| Provably fast training algorithms for support vector machines | 2008-06-06 | Paper |
| A Simple Message Passing Algorithm for Graph Partitioning Problems | 2008-04-24 | Paper |
| On the Complexity of Kings | 2008-02-26 | Paper |
| Finding Most Likely Solutions | 2007-11-13 | Paper |
| Average-Case Analysis for the MAX-2SAT Problem | 2007-09-04 | Paper |
| Randomized algorithms for 3-SAT | 2007-03-12 | Paper |
| Stochastic Algorithms: Foundations and Applications | 2006-10-20 | Paper |
| Random access to advice strings and collapsing results | 2006-10-16 | Paper |
| Distributions in the Ehrenfest process | 2006-06-30 | Paper |
| Sequential sampling techniques for algorithmic learning theory | 2006-01-10 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5703615 | 2005-11-08 | Paper |
| Algorithmic Learning Theory | 2005-08-18 | Paper |
| On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy | 2005-02-21 | Paper |
| Games with uniqueness properties | 2005-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736839 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736857 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044518 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739610 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473229 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473548 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473978 | 2004-08-04 | Paper |
| The difference between polynomial-time many-one and truth-table reducibilities on distributional problems | 2002-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4780793 | 2002-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4551387 | 2002-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548338 | 2002-08-26 | Paper |
| Adaptive sampling methods for scaling up knowledge discovery algorithms | 2002-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762496 | 2002-01-09 | Paper |
| Crystal plasticity: Micro-shear banding in polycrystals using Voronoi tessellation | 2001-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2743805 | 2001-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942035 | 2001-03-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520487 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520312 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525683 | 2001-01-24 | Paper |
| Application of crystal plasticity to plastic behavior at notched plate and crack propagation | 2000-12-18 | Paper |
| Resource-bounded measure and learnability | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942650 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938667 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705510 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703659 | 1999-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258590 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246732 | 1999-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246734 | 1999-06-15 | Paper |
| Boolean operations, joins, and the extended low hierarchy | 1999-01-12 | Paper |
| New Collapse Consequences of NP Having Small Circuits | 1998-09-21 | Paper |
| Partial Occam's Razor and its applications | 1998-08-13 | Paper |
| Randomized approximation of the constraint satisfaction problem | 1998-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4370217 | 1998-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129925 | 1997-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336266 | 1997-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336267 | 1997-06-12 | Paper |
| On sets bounded truth-table reducible to $P$-selective sets | 1997-04-13 | Paper |
| On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\) | 1997-03-31 | Paper |
| On random hard sets for NP | 1997-01-02 | Paper |
| On symmetry of information and polynomial time invertibility | 1996-02-20 | Paper |
| On closure properties of GapP | 1995-05-14 | Paper |
| Structural analysis of polynomial-time query learnability | 1995-03-20 | Paper |
| Instance complexity | 1995-03-01 | Paper |
| Upward separation for FewP and related classes | 1995-02-16 | Paper |
| The query complexity of learning DFA | 1994-11-20 | Paper |
| On the Computational Complexity of Small Descriptions | 1994-11-13 | Paper |
| A framework for polynomial-time query learnability | 1994-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4038688 | 1993-05-18 | Paper |
| Structural analysis of the complexity of inverse functions | 1993-05-17 | Paper |
| Relating Equivalence and Reducibility to Sparse Sets | 1993-01-16 | Paper |
| On polynomial time one-truth-table reducibility to a sparse set | 1992-09-27 | Paper |
| Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P | 1992-09-27 | Paper |
| On polynomial-time Turing and many-one completeness in PSPACE | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3976035 | 1992-06-26 | Paper |
| Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets | 1992-06-25 | Paper |
| On the p-isomorphism conjecture | 1991-01-01 | Paper |
| On intractability of the classUP | 1991-01-01 | Paper |
| Kolmogorov complexity and degrees of tally sets | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3493228 | 1989-01-01 | Paper |
| On Tally Relativizations of $BP$-Complexity Classes | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4205082 | 1989-01-01 | Paper |
| On hardness of one-way functions | 1988-01-01 | Paper |
| Lowness Properties of Sets in the Exponential-Time Hierarchy | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3826109 | 1988-01-01 | Paper |
| A comparison of polynomial time completeness notions | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795786 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815624 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4727431 | 1986-01-01 | Paper |
| Internal time, general internal variable, and multi-yield-surface theories of plasticity and creep: A unification of concepts | 1986-01-01 | Paper |
| Constitutive modeling of cyclic plasticity and creep, using an internal time concept | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747724 | 1986-01-01 | Paper |
| On one-one polynomial time equivalence relations | 1985-01-01 | Paper |
| A New Endochronic Approach to Computational Elastoplasticity: Example of a Cyclically Loaded Cracked Plate | 1985-01-01 | Paper |
| Notes on theta functions for open Riemann surfaces | 1983-01-01 | Paper |
| The time-precision tradeoff problem on on-line probabilistic Turing machines | 1983-01-01 | Paper |
| Reproducing differentials and certain theta functions on open Riemann surfaces | 1981-01-01 | Paper |
| A fast algorithm for finding all shortest paths | 1981-01-01 | Paper |
| Theory of meromorphic differentials with infinitely many poles on open Riemann surfaces | 1977-01-01 | Paper |
| A decomposition of meromorphic differentials and its applications | 1976-01-01 | Paper |
