| Publication | Date of Publication | Type |
|---|
The join can lower complexity
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| scientific article; zbMATH DE number 7758317 (Why is no real title available?) | 2023-10-31 | Paper |
On the complexity of small description and related topics
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
The robustness of LWPP and WPP, with an application to graph reconstruction
(available as arXiv preprint) | 2021-08-04 | Paper |
The robustness of LWPP and WPP, with an application to graph reconstruction
Computational Complexity | 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
Complexity and Approximation | 2020-07-20 | Paper |
An improvement of the algorithm of Hertli for the unique 3SAT problem
Theoretical Computer Science | 2020-01-16 | Paper |
Message passing algorithms for MLS-3LIN problem
2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-17 | Paper |
Polynomial size linear programs for problems in \textsc{P}
Discrete Applied Mathematics | 2019-07-17 | Paper |
New collapse consequences of NP having small circuits
Automata, Languages and Programming | 2019-01-10 | Paper |
An improvement of the algorithm of Hertli for the unique 3SAT problem
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
On the optimality of lattices for the Coppersmith technique
Applicable Algebra in Engineering, Communication and Computing | 2018-04-18 | Paper |
The query complexity of witness finding
Theory of Computing Systems | 2017-10-20 | Paper |
| Limits of minimum circuit size problem as oracle | 2017-10-10 | Paper |
Local restrictions from the Furst-Saxe-Sipser paper
Theory of Computing Systems | 2017-03-31 | Paper |
A short implicant of a CNF formula with many satisfying assignments
Algorithmica | 2016-12-21 | Paper |
A short implicant of a CNF formula with many satisfying assignments
Algorithms and Computation | 2015-09-11 | Paper |
On the limit of some algorithmic approach to circuit lower bounds
Computing with New Resources | 2015-09-08 | Paper |
Interval graph representation with given interval and intersection lengths
Journal of Discrete Algorithms | 2015-08-24 | Paper |
The query complexity of witness finding
Computer Science - Theory and Applications | 2014-06-24 | Paper |
A new model for a scale-free hierarchical structure of isolated cliques
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Interval graph representation with given interval and intersection lengths
Algorithms and Computation | 2013-03-21 | Paper |
Propagation connectivity of random hypergraphs
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
| scientific article; zbMATH DE number 6019545 (Why is no real title available?) | 2012-03-29 | Paper |
On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Weighted random popular matchings
Random Structures & Algorithms | 2010-12-14 | Paper |
Propagation connectivity of random hypergraphs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Average-case analysis for the MAX-2SAT problem
Theoretical Computer Science | 2010-04-15 | Paper |
A new model for a scale-free hierarchical structure of isolated cliques
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
On the complexity of kings
Theoretical Computer Science | 2010-02-09 | Paper |
Scale free interval graphs
Theoretical Computer Science | 2009-11-04 | Paper |
Finding most likely solutions
Theory of Computing Systems | 2009-10-19 | Paper |
Substring search and repeat search using factor oracles
Information Processing Letters | 2009-08-27 | Paper |
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2009-08-06 | Paper |
Relativized collapsing between BPP and PH under stringent oracle access
Information Processing Letters | 2009-07-21 | Paper |
Stochastic Algorithms: Foundations and Applications
Lecture Notes in Computer Science | 2009-05-26 | Paper |
Scale Free Interval Graphs
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Provably fast training algorithms for support vector machines
Theory of Computing Systems | 2008-06-06 | Paper |
A Simple Message Passing Algorithm for Graph Partitioning Problems
Algorithms and Computation | 2008-04-24 | Paper |
On the Complexity of Kings
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Finding Most Likely Solutions
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Average-Case Analysis for the MAX-2SAT Problem
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Randomized algorithms for 3-SAT
Theory of Computing Systems | 2007-03-12 | Paper |
Stochastic Algorithms: Foundations and Applications
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Random access to advice strings and collapsing results
Algorithmica | 2006-10-16 | Paper |
Distributions in the Ehrenfest process
Statistics & Probability Letters | 2006-06-30 | Paper |
Sequential sampling techniques for algorithmic learning theory
Theoretical Computer Science | 2006-01-10 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
| scientific article; zbMATH DE number 2226659 (Why is no real title available?) | 2005-11-08 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy
SIAM Journal on Computing | 2005-02-21 | Paper |
Games with uniqueness properties
Theory of Computing Systems | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 2086402 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086385 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086343 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2083809 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080913 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080438 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080653 (Why is no real title available?) | 2004-08-04 | Paper |
The difference between polynomial-time many-one and truth-table reducibilities on distributional problems
Theory of Computing Systems | 2002-12-01 | Paper |
| scientific article; zbMATH DE number 1833412 (Why is no real title available?) | 2002-11-21 | Paper |
| scientific article; zbMATH DE number 1796991 (Why is no real title available?) | 2002-09-05 | Paper |
| scientific article; zbMATH DE number 1788736 (Why is no real title available?) | 2002-08-26 | Paper |
Adaptive sampling methods for scaling up knowledge discovery algorithms
Data Mining and Knowledge Discovery | 2002-05-30 | Paper |
| scientific article; zbMATH DE number 1688354 (Why is no real title available?) | 2002-01-09 | Paper |
Crystal plasticity: Micro-shear banding in polycrystals using Voronoi tessellation
International Journal of Plasticity | 2001-10-01 | Paper |
| scientific article; zbMATH DE number 1418473 (Why is no real title available?) | 2001-03-12 | Paper |
| scientific article; zbMATH DE number 1543037 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1542859 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1555920 (Why is no real title available?) | 2001-01-24 | Paper |
Application of crystal plasticity to plastic behavior at notched plate and crack propagation
International Journal of Mechanical Sciences | 2000-12-18 | Paper |
Resource-bounded measure and learnability
Theory of Computing Systems | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1414313 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1405686 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1380809 (Why is no real title available?) | 1999-12-20 | Paper |
| scientific article; zbMATH DE number 1379310 (Why is no real title available?) | 1999-12-15 | Paper |
| scientific article; zbMATH DE number 1335899 (Why is no real title available?) | 1999-09-13 | Paper |
| scientific article; zbMATH DE number 1301089 (Why is no real title available?) | 1999-06-15 | Paper |
| scientific article; zbMATH DE number 1301087 (Why is no real title available?) | 1999-06-15 | Paper |
Boolean operations, joins, and the extended low hierarchy
Theoretical Computer Science | 1999-01-12 | Paper |
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing | 1998-09-21 | Paper |
Partial Occam's Razor and its applications
Information Processing Letters | 1998-08-13 | Paper |
Randomized approximation of the constraint satisfaction problem
Algorithm Theory — SWAT'96 | 1998-06-22 | Paper |
| scientific article; zbMATH DE number 1104344 (Why is no real title available?) | 1998-01-14 | Paper |
| scientific article; zbMATH DE number 1002207 (Why is no real title available?) | 1997-09-07 | Paper |
| scientific article; zbMATH DE number 1008507 (Why is no real title available?) | 1997-06-12 | Paper |
| scientific article; zbMATH DE number 1008506 (Why is no real title available?) | 1997-06-12 | Paper |
On sets bounded truth-table reducible to $P$-selective sets
RAIRO - Theoretical Informatics and Applications | 1997-04-13 | Paper |
On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)
Journal of Computer and System Sciences | 1997-03-31 | Paper |
On random hard sets for NP
Information and Computation | 1997-01-02 | Paper |
On symmetry of information and polynomial time invertibility
Information and Computation | 1996-02-20 | Paper |
On closure properties of GapP
Computational Complexity | 1995-05-14 | Paper |
Structural analysis of polynomial-time query learnability
Mathematical Systems Theory | 1995-03-20 | Paper |
Instance complexity
Journal of the ACM | 1995-03-01 | Paper |
Upward separation for FewP and related classes
Information Processing Letters | 1995-02-16 | Paper |
The query complexity of learning DFA
New Generation Computing | 1994-11-20 | Paper |
On the Computational Complexity of Small Descriptions
SIAM Journal on Computing | 1994-11-13 | Paper |
A framework for polynomial-time query learnability
Mathematical Systems Theory | 1994-07-26 | Paper |
| scientific article; zbMATH DE number 177810 (Why is no real title available?) | 1993-05-18 | Paper |
Structural analysis of the complexity of inverse functions
Mathematical Systems Theory | 1993-05-17 | Paper |
Relating Equivalence and Reducibility to Sparse Sets
SIAM Journal on Computing | 1993-01-16 | Paper |
Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P
Theoretical Computer Science | 1992-09-27 | Paper |
On polynomial-time Turing and many-one completeness in PSPACE
Theoretical Computer Science | 1992-09-27 | Paper |
On polynomial time one-truth-table reducibility to a sparse set
Journal of Computer and System Sciences | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 18632 (Why is no real title available?) | 1992-06-26 | Paper |
Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
SIAM Journal on Computing | 1992-06-25 | Paper |
On the p-isomorphism conjecture
Theoretical Computer Science | 1991-01-01 | Paper |
On intractability of the classUP
Mathematical Systems Theory | 1991-01-01 | Paper |
Kolmogorov complexity and degrees of tally sets
Information and Computation | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4166857 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4125016 (Why is no real title available?) | 1989-01-01 | Paper |
On Tally Relativizations of $BP$-Complexity Classes
SIAM Journal on Computing | 1989-01-01 | Paper |
On hardness of one-way functions
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4100610 (Why is no real title available?) | 1988-01-01 | Paper |
Lowness Properties of Sets in the Exponential-Time Hierarchy
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4061401 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4087147 (Why is no real title available?) | 1987-01-01 | Paper |
A comparison of polynomial time completeness notions
Theoretical Computer Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3984572 (Why is no real title available?) | 1986-01-01 | Paper |
Constitutive modeling of cyclic plasticity and creep, using an internal time concept
International Journal of Plasticity | 1986-01-01 | Paper |
Internal time, general internal variable, and multi-yield-surface theories of plasticity and creep: A unification of concepts
International Journal of Plasticity | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4001485 (Why is no real title available?) | 1986-01-01 | Paper |
On one-one polynomial time equivalence relations
Theoretical Computer Science | 1985-01-01 | Paper |
A New Endochronic Approach to Computational Elastoplasticity: Example of a Cyclically Loaded Cracked Plate
Journal of Applied Mechanics | 1985-01-01 | Paper |
Notes on theta functions for open Riemann surfaces
Journal of Mathematics of Kyoto University | 1983-01-01 | Paper |
The time-precision tradeoff problem on on-line probabilistic Turing machines
Theoretical Computer Science | 1983-01-01 | Paper |
A fast algorithm for finding all shortest paths
Information Processing Letters | 1981-01-01 | Paper |
Reproducing differentials and certain theta functions on open Riemann surfaces
Journal of Mathematics of Kyoto University | 1981-01-01 | Paper |
Theory of meromorphic differentials with infinitely many poles on open Riemann surfaces
Journal of Mathematics of Kyoto University | 1977-01-01 | Paper |
A decomposition of meromorphic differentials and its applications
Journal of Mathematics of Kyoto University | 1976-01-01 | Paper |
