| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Manfred Schmidt-Schauß, Georg Schnitger |
Fast equality test for straight-line compressed strings.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Yet harder knapsack problems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Ambiguity and Communication. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Min-rank conjecture for log-depth circuits. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Poloczek, Georg Schnitger |
Randomized Variants of Johnson’s Algorithm for MAX SAT. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
On probabilistic pushdown automata. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Circuits with arbitrary gates for random operators |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Min-Rank Conjecture for Log-Depth Circuits |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Min-Rank Conjecture for Log-Depth Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Juraj Hromkovic, Holger Petersen, Georg Schnitger |
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Ambiguity and Communication |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Ambiguity and Communication. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Comparing the size of NFAs with and without epsilon-transitions. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregor Gramlich, Georg Schnitger |
Minimizing nfa's and regular expressions. |
J. Comput. Syst. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maik Weinard, Georg Schnitger |
On the Greedy Superstring Conjecture. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Schnitger |
Regular Expressions and NFAs Without epsilon-Transitions. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
On the power of randomized multicounter machines. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
NFAs With and Without epsilon-Transitions. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregor Gramlich, Georg Schnitger |
Minimizing NFA's and Regular Expressions. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. |
DCFS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On multi-partition communication complexity. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Nondeterministic Communication with a Limited Number of Advice Bits. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
descriptional complexity of regular languages, Finite automata, nondeterminism |
| 1 | Juraj Hromkovic, Georg Schnitger |
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
multicounter machines, randomization, nondeterminism, complexity theory, pushdown automata |
| 1 | Maik Weinard, Georg Schnitger |
On the Greedy Superstring Conjecture. |
FSTTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger |
Communication Complexity Method for Measuring Nondeterminism in Finite Automata. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Triangle-Freeness Is Hard To Detect. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On Multipartition Communication Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
On Multi-Partition Communication Complexity of Triangle-Freeness |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
On the power of Las Vegas II: Two-way finite automata. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata. |
Inf. Comput. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On Multipartition Communication Complexity. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
On the Power of Randomized Pushdown Automata. |
Developments in Language Theory |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
Measures of Nondeterminism in Finite Automata |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert |
Measures of Nondeterminism in Finite Automata. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
limited ambiguity, communication complexity, finite automata, nondeterminism, descriptional complexity |
| 1 | Juraj Hromkovic, Georg Schnitger |
On the Power of Las Vegas II: Two-Way Finite Automata |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
On the Power of Las Vegas II. Two-Way Finite Automata. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Miltrup, Georg Schnitger |
Neural Networks and Efficient Associative Memory. |
COLT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger |
On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Communication Complexity and Sequential Compuation. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
Las Vegas, communication complexity, automata, determinism, computational and structural complexity |
| 1 | Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger |
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
Las Vegas, communication complexity, automata, determinism, computational and structural complexity |
| 1 | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
A Comparison of Two Lower-Bound Methods for Communication Complexity. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhaskar DasGupta, Georg Schnitger |
Analog versus discrete neural networks. |
Neural Computation |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Juraj Hromkovic, Georg Schnitger |
Nondeterministic Communication with a Limited Number of Advice Bits. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff I. Chu, Georg Schnitger |
Communication Complexity of Matrix Computation over Finite Fields. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger |
A Comparison of Two Lower Bound Methods for Communication Complexity. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán |
Two Tapes Versus One for Off-Line Turing Machines. |
Computational Complexity |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Georg Schnitger |
On the Complexity of Approximating the Independent Set Problem |
Inf. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Kalyanasundaram, Georg Schnitger |
The Probabilistic Communication Complexity of Set Intersection. |
SIAM J. Discrete Math. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhaskar DasGupta, Georg Schnitger |
The Power of Approximation: A Comparison of Activation Functions. |
NIPS |
1992 |
DBLP BibTeX RDF |
|
| 1 | Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger |
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. |
Theor. Comput. Sci. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff I. Chu, Georg Schnitger |
The communication complexity of several problems in matrix computation. |
J. Complexity |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Kalyanasundaram, Georg Schnitger |
On the power of white pebbles. |
Combinatorica |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass, Georg Schnitger, Eduardo D. Sontag |
On the Computational Power of Sigmoid versus Boolean Threshold Circuits |
FOCS |
1991 |
DBLP DOI BibTeX RDF |
polynomially bounded weights, sigmoid threshold gates, smooth threshold gates, depth 2 circuits, Boolean threshold circuits, constant size circuits, Boolean threshold gates, polynomial size sigmoid threshold circuits, Boolean functions, computational power, constant depth circuits |
| 1 | Bala Kalyanasundaram, Georg Schnitger |
Rounds Versus Time for the Two Person Pebble Game |
Inf. Comput. |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ian Parberry, Georg Schnitger |
Relating Boltzmann machines to conventional models of computation. |
Neural Networks |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Piotr Berman, Georg Schnitger |
On the Complexity of Approximating the Independent Set Problem. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Kalyanasundaram, Georg Schnitger |
Rounds versus Time for the Two Person Pebble Game (Extended Abstract). |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeff I. Chu, Georg Schnitger |
The Communication Complexity of Several Problems in Matrix Computation. |
SPAA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ian Parberry, Georg Schnitger |
Parallel Computation with Threshold Functions. |
J. Comput. Syst. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Bala Kalyanasundaram, Georg Schnitger |
On the Power of White Pebbles (Extended Abstract) |
STOC |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil, Georg Schnitger |
Lower Bounds on Communication Complexity |
Inf. Comput. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Ian Parberry, Georg Schnitger |
Relating Boltzmann Machines to Conventional Models of Computation. |
ISMIS |
1987 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Maass, Georg Schnitger, Endre Szemerédi |
Two Tapes Are Better than One for Off-Line Turing Machines |
STOC |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Ian Parberry, Georg Schnitger |
Parallel Computation with Threshold Functions. |
Structure in Complexity Theory Conference |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Maass, Georg Schnitger |
An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape. |
Structure in Complexity Theory Conference |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Zvi Galil, Georg Schnitger |
Lower Bounds on Communication Complexity |
STOC |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Schnitger |
On Depth-Reduction and Grates |
FOCS |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Schnitger |
A Family of Graphs with Expensive Depth Reduction. |
Theor. Comput. Sci. |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Reisch, Georg Schnitger |
Three Applications of Kolmogorov-Complexity |
FOCS |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg Schnitger |
A Family of Graphs with Expensive Depth-Reduction. |
Theoretical Computer Science |
1981 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")