| 2009 |
|---|
| 61 | EE | Juraj Hromkovic,
Georg Schnitger:
Ambiguity and Communication.
STACS 2009: 553-564 |
| 60 | EE | Juraj Hromkovic,
Georg Schnitger:
Ambiguity and Communication
CoRR abs/0902.2140: (2009) |
| 2008 |
|---|
| 59 | EE | 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: 34-55 |
| 2007 |
|---|
| 58 | EE | Gregor Gramlich,
Georg Schnitger:
Minimizing nfa's and regular expressions.
J. Comput. Syst. Sci. 73(6): 908-923 (2007) |
| 57 | EE | Juraj Hromkovic,
Georg Schnitger:
Comparing the size of NFAs with and without epsilon-transitions.
Theor. Comput. Sci. 380(1-2): 100-114 (2007) |
| 2006 |
|---|
| 56 | EE | Georg Schnitger:
Regular Expressions and NFAs Without epsilon-Transitions.
STACS 2006: 432-443 |
| 55 | EE | Maik Weinard,
Georg Schnitger:
On the Greedy Superstring Conjecture.
SIAM J. Discrete Math. 20(2): 502-522 (2006) |
| 2005 |
|---|
| 54 | EE | Juraj Hromkovic,
Georg Schnitger:
NFAs With and Without epsilon-Transitions.
ICALP 2005: 385-396 |
| 53 | EE | Gregor Gramlich,
Georg Schnitger:
Minimizing NFA's and Regular Expressions.
STACS 2005: 399-411 |
| 52 | EE | Juraj Hromkovic,
Georg Schnitger:
On the power of randomized multicounter machines.
Theor. Comput. Sci. 330(1): 135-144 (2005) |
| 2004 |
|---|
| 51 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On multi-partition communication complexity.
Inf. Comput. 194(1): 49-75 (2004) |
| 2003 |
|---|
| 50 | EE | Maik Weinard,
Georg Schnitger:
On the Greedy Superstring Conjecture.
FSTTCS 2003: 387-398 |
| 49 | EE | Juraj Hromkovic,
Georg Schnitger:
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation.
ICALP 2003: 439-451 |
| 48 | EE | Juraj Hromkovic,
Georg Schnitger:
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes.
ICALP 2003: 66-80 |
| 47 | EE | Juraj Hromkovic,
Georg Schnitger:
Nondeterministic Communication with a Limited Number of Advice Bits.
SIAM J. Comput. 33(1): 43-68 (2003) |
| 2002 |
|---|
| 46 | | Stasys Jukna,
Georg Schnitger:
Triangle-Freeness Is Hard To Detect.
Combinatorics, Probability & Computing 11(6): (2002) |
| 45 | EE | Juraj Hromkovic,
Sebastian Seibert,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger:
Communication Complexity Method for Measuring Nondeterminism in Finite Automata.
Inf. Comput. 172(2): 202-217 (2002) |
| 2001 |
|---|
| 44 | EE | Juraj Hromkovic,
Georg Schnitger:
On the Power of Randomized Pushdown Automata.
Developments in Language Theory 2001: 262-271 |
| 43 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On Multipartition Communication Complexity.
STACS 2001: 206-217 |
| 42 | EE | Pavol Duris,
Juraj Hromkovic,
Stasys Jukna,
Martin Sauerhoff,
Georg Schnitger:
On Multipartition Communication Complexity
Electronic Colloquium on Computational Complexity (ECCC) 8(066): (2001) |
| 41 | EE | Stasys Jukna,
Georg Schnitger:
On Multi-Partition Communication Complexity of Triangle-Freeness
Electronic Colloquium on Computational Complexity (ECCC) 8(49): (2001) |
| 40 | | Juraj Hromkovic,
Georg Schnitger:
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata.
Inf. Comput. 169(2): 284-296 (2001) |
| 39 | EE | Juraj Hromkovic,
Georg Schnitger:
On the power of Las Vegas II: Two-way finite automata.
Theor. Comput. Sci. 262(1): 1-24 (2001) |
| 2000 |
|---|
| 38 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger,
Sebastian Seibert:
Measures of Nondeterminism in Finite Automata.
ICALP 2000: 199-210 |
| 37 | EE | Juraj Hromkovic,
Juhani Karhumäki,
Hartmut Klauck,
Georg Schnitger,
Sebastian Seibert:
Measures of Nondeterminism in Finite Automata
Electronic Colloquium on Computational Complexity (ECCC) 7(76): (2000) |
| 1999 |
|---|
| 36 | EE | Juraj Hromkovic,
Georg Schnitger:
On the Power of Las Vegas II. Two-Way Finite Automata.
ICALP 1999: 433-442 |
| 35 | EE | Juraj Hromkovic,
Georg Schnitger:
On the Power of Las Vegas II: Two-Way Finite Automata
Electronic Colloquium on Computational Complexity (ECCC) 6(7): (1999) |
| 1998 |
|---|
| 34 | EE | Matthias Miltrup,
Georg Schnitger:
Neural Networks and Efficient Associative Memory.
COLT 1998: 235-246 |
| 1997 |
|---|
| 33 | | Juraj Hromkovic,
Georg Schnitger:
Communication Complexity and Sequential Compuation.
MFCS 1997: 71-84 |
| 32 | | 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: 117-128 |
| 31 | EE | 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) 4(29): (1997) |
| 1996 |
|---|
| 30 | EE | Juraj Hromkovic,
Georg Schnitger:
Nondeterministic Communication with a Limited Number of Advice Bits.
STOC 1996: 551-560 |
| 29 | | Bhaskar DasGupta,
Georg Schnitger:
Analog versus discrete neural networks.
Neural Computation 8(4): 805-818 (1996) |
| 28 | EE | Martin Dietzfelbinger,
Juraj Hromkovic,
Georg Schnitger:
A Comparison of Two Lower-Bound Methods for Communication Complexity.
Theor. Comput. Sci. 168(1): 39-51 (1996) |
| 1995 |
|---|
| 27 | | Jeff I. Chu,
Georg Schnitger:
Communication Complexity of Matrix Computation over Finite Fields.
Mathematical Systems Theory 28(3): 215-228 (1995) |
| 1994 |
|---|
| 26 | | Martin Dietzfelbinger,
Juraj Hromkovic,
Georg Schnitger:
A Comparison of Two Lower Bound Methods for Communication Complexity.
MFCS 1994: 326-335 |
| 1993 |
|---|
| 25 | | Wolfgang Maass,
Georg Schnitger,
Endre Szemerédi,
György Turán:
Two Tapes Versus One for Off-Line Turing Machines.
Computational Complexity 3: 392-401 (1993) |
| 1992 |
|---|
| 24 | EE | Bhaskar DasGupta,
Georg Schnitger:
The Power of Approximation: A Comparison of Activation Functions.
NIPS 1992: 615-622 |
| 23 | | Piotr Berman,
Georg Schnitger:
On the Complexity of Approximating the Independent Set Problem
Inf. Comput. 96(1): 77-94 (1992) |
| 22 | | Bala Kalyanasundaram,
Georg Schnitger:
The Probabilistic Communication Complexity of Set Intersection.
SIAM J. Discrete Math. 5(4): 545-557 (1992) |
| 1991 |
|---|
| 21 | | Wolfgang Maass,
Georg Schnitger,
Eduardo D. Sontag:
On the Computational Power of Sigmoid versus Boolean Threshold Circuits
FOCS 1991: 767-776 |
| 20 | | Bala Kalyanasundaram,
Georg Schnitger:
On the power of white pebbles.
Combinatorica 11(2): 157-171 (1991) |
| 19 | EE | Jeff I. Chu,
Georg Schnitger:
The communication complexity of several problems in matrix computation.
J. Complexity 7(4): 395-407 (1991) |
| 18 | | Martin Dietzfelbinger,
Wolfgang Maass,
Georg Schnitger:
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines.
Theor. Comput. Sci. 82(1): 113-129 (1991) |
| 1990 |
|---|
| 17 | | Bala Kalyanasundaram,
Georg Schnitger:
Rounds Versus Time for the Two Person Pebble Game
Inf. Comput. 88(1): 1-17 (1990) |
| 1989 |
|---|
| 16 | EE | Jeff I. Chu,
Georg Schnitger:
The Communication Complexity of Several Problems in Matrix Computation.
SPAA 1989: 22-31 |
| 15 | | Piotr Berman,
Georg Schnitger:
On the Complexity of Approximating the Independent Set Problem.
STACS 1989: 256-268 |
| 14 | | Bala Kalyanasundaram,
Georg Schnitger:
Rounds versus Time for the Two Person Pebble Game (Extended Abstract).
STACS 1989: 517-529 |
| 13 | EE | Ian Parberry,
Georg Schnitger:
Relating Boltzmann machines to conventional models of computation.
Neural Networks 2(1): 59-67 (1989) |
| 1988 |
|---|
| 12 | | Bala Kalyanasundaram,
Georg Schnitger:
On the Power of White Pebbles (Extended Abstract)
STOC 1988: 258-266 |
| 11 | | Ian Parberry,
Georg Schnitger:
Parallel Computation with Threshold Functions.
J. Comput. Syst. Sci. 36(3): 278-302 (1988) |
| 1987 |
|---|
| 10 | | Ian Parberry,
Georg Schnitger:
Relating Boltzmann Machines to Conventional Models of Computation.
ISMIS 1987: 347-354 |
| 9 | | Wolfgang Maass,
Georg Schnitger,
Endre Szemerédi:
Two Tapes Are Better than One for Off-Line Turing Machines
STOC 1987: 94-100 |
| 8 | | Pavol Duris,
Zvi Galil,
Georg Schnitger:
Lower Bounds on Communication Complexity
Inf. Comput. 73(1): 1-22 (1987) |
| 1986 |
|---|
| 7 | | 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: 249-264 |
| 6 | | Ian Parberry,
Georg Schnitger:
Parallel Computation with Threshold Functions.
Structure in Complexity Theory Conference 1986: 272-290 |
| 1984 |
|---|
| 5 | | Pavol Duris,
Zvi Galil,
Georg Schnitger:
Lower Bounds on Communication Complexity
STOC 1984: 81-91 |
| 1983 |
|---|
| 4 | | Georg Schnitger:
On Depth-Reduction and Grates
FOCS 1983: 323-328 |
| 1982 |
|---|
| 3 | | Stefan Reisch,
Georg Schnitger:
Three Applications of Kolmogorov-Complexity
FOCS 1982: 45-52 |
| 2 | | Georg Schnitger:
A Family of Graphs with Expensive Depth Reduction.
Theor. Comput. Sci. 18: 89-93 (1982) |
| 1981 |
|---|
| 1 | | Georg Schnitger:
A Family of Graphs with Expensive Depth-Reduction.
Theoretical Computer Science 1981: 91-97 |
