default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorg Schnitger
Person information
- affiliation: Goethe University Frankfurt am Main, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c35]Georg Schnitger:
Probabilism versus Alternation for Automata. Adventures Between Lower Bounds and Higher Altitudes 2018: 113-126- 2017
- [j35]Matthias Poloczek, Georg Schnitger, David P. Williamson, Anke van Zuylen:
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. SIAM J. Comput. 46(3): 1029-1061 (2017) - 2016
- [j34]Stasys Jukna
, Georg Schnitger:
On the optimality of Bellman-Ford-Moore shortest path algorithm. Theor. Comput. Sci. 628: 101-109 (2016) - 2015
- [i12]Stasys Jukna, Georg Schnitger:
On the Optimality of Bellman-Ford-Moore Shortest Path Algorithm. Electron. Colloquium Comput. Complex. TR15 (2015) - 2012
- [j33]Manfred Schmidt-Schauß, Georg Schnitger:
Fast equality test for straight-line compressed strings. Inf. Process. Lett. 112(8-9): 341-345 (2012) - [j32]Stasys Jukna, Georg Schnitger:
Cutting planes cannot approximate some integer programs. Oper. Res. Lett. 40(4): 272-275 (2012) - 2011
- [j31]Stasys Jukna, Georg Schnitger:
Min-rank conjecture for log-depth circuits. J. Comput. Syst. Sci. 77(6): 1023-1038 (2011) - [j30]Juraj Hromkovic, Georg Schnitger:
Ambiguity and Communication. Theory Comput. Syst. 48(3): 517-534 (2011) - [j29]Stasys Jukna, Georg Schnitger:
Yet harder knapsack problems. Theor. Comput. Sci. 412(45): 6351-6358 (2011) - [c34]Matthias Poloczek, Georg Schnitger:
Randomized Variants of Johnson's Algorithm for MAX SAT. SODA 2011: 656-663 - 2010
- [j28]Juraj Hromkovic, Georg Schnitger:
On probabilistic pushdown automata. Inf. Comput. 208(8): 982-995 (2010) - [i11]Stasys Jukna, Georg Schnitger:
Circuits with arbitrary gates for random operators. CoRR abs/1004.5236 (2010) - [i10]Stasys Jukna, Georg Schnitger:
Min-Rank Conjecture for Log-Depth Circuits. CoRR abs/1005.1009 (2010)
2000 – 2009
- 2009
- [j27]Juraj Hromkovic, Georg Schnitger:
Lower Bounds on the Size of Sweeping Automata. J. Autom. Lang. Comb. 14(1): 23-31 (2009) - [j26]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. 410(30-32): 2972-2981 (2009) - [c33]Juraj Hromkovic, Georg Schnitger:
Ambiguity and Communication. STACS 2009: 553-564 - [i9]Juraj Hromkovic, Georg Schnitger:
Ambiguity and Communication. CoRR abs/0902.2140 (2009) - [i8]Stasys Jukna, Georg Schnitger:
Min-Rank Conjecture for Log-Depth Circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [c32]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 - [e1]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
Computational Complexity of Discrete Problems, 14.09. - 19.09.2008. Dagstuhl Seminar Proceedings 08381, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - [i7]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
08381 Abstracts Collection - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems 2008 - [i6]Peter Bro Miltersen, Rüdiger Reischuk, Georg Schnitger, Dieter van Melkebeek:
08381 Executive Summary - Computational Complexity of Discrete Problems. Computational Complexity of Discrete Problems 2008 - 2007
- [j25]Gregor Gramlich, Georg Schnitger:
Minimizing nfa's and regular expressions. J. Comput. Syst. Sci. 73(6): 908-923 (2007) - [j24]Juraj Hromkovic, Georg Schnitger:
Comparing the size of NFAs with and without epsilon-transitions. Theor. Comput. Sci. 380(1-2): 100-114 (2007) - 2006
- [j23]Maik Weinard, Georg Schnitger:
On the Greedy Superstring Conjecture. SIAM J. Discret. Math. 20(2): 502-522 (2006) - [c31]Georg Schnitger:
Regular Expressions and NFAs Without epsilon-Transitions. STACS 2006: 432-443 - 2005
- [j22]Juraj Hromkovic, Georg Schnitger:
On the power of randomized multicounter machines. Theor. Comput. Sci. 330(1): 135-144 (2005) - [c30]Juraj Hromkovic, Georg Schnitger:
Communication Complexity Method for Proving Lower Bounds on Descriptional Complexity in Automata and Formal Language Theory. DCFS 2005: 38-38 - [c29]Juraj Hromkovic, Georg Schnitger:
NFAs With and Without epsilon-Transitions. ICALP 2005: 385-396 - [c28]Gregor Gramlich, Georg Schnitger:
Minimizing NFA's and Regular Expressions. STACS 2005: 399-411 - 2004
- [j21]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004) - 2003
- [j20]Juraj Hromkovic, Georg Schnitger:
Nondeterministic Communication with a Limited Number of Advice Bits. SIAM J. Comput. 33(1): 43-68 (2003) - [c27]Maik Weinard, Georg Schnitger:
On the Greedy Superstring Conjecture. FSTTCS 2003: 387-398 - [c26]Juraj Hromkovic, Georg Schnitger:
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. ICALP 2003: 66-80 - [c25]Juraj Hromkovic, Georg Schnitger:
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. ICALP 2003: 439-451 - 2002
- [j19]Stasys Jukna, Georg Schnitger:
Triangle-Freeness Is Hard To Detect. Comb. Probab. Comput. 11(6): 549-569 (2002) - [j18]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
- [j17]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) - [j16]Juraj Hromkovic, Georg Schnitger:
On the power of Las Vegas II: Two-way finite automata. Theor. Comput. Sci. 262(1): 1-24 (2001) - [c24]Juraj Hromkovic, Georg Schnitger:
On the Power of Randomized Pushdown Automata. Developments in Language Theory 2001: 262-271 - [c23]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On Multipartition Communication Complexity. STACS 2001: 206-217 - [i5]Stasys Jukna, Georg Schnitger:
On Multi-Partition Communication Complexity of Triangle-Freeness. Electron. Colloquium Comput. Complex. TR01 (2001) - [i4]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On Multipartition Communication Complexity. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c22]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert:
Measures of Nondeterminism in Finite Automata. ICALP 2000: 199-210 - [i3]Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert:
Measures of Nondeterminism in Finite Automata. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1999
- [c21]Juraj Hromkovic, Georg Schnitger:
On the Power of Las Vegas II. Two-Way Finite Automata. ICALP 1999: 433-442 - [i2]Juraj Hromkovic, Georg Schnitger:
On the Power of Las Vegas II: Two-Way Finite Automata. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [c20]Matthias Miltrup, Georg Schnitger:
Neural Networks and Efficient Associative Memory. COLT 1998: 235-246 - 1997
- [c19]Juraj Hromkovic, Georg Schnitger:
Communication Complexity and Sequential Compuation. MFCS 1997: 71-84 - [c18]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 - [i1]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. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [j15]Bhaskar DasGupta, Georg Schnitger:
Analog versus discrete neural networks. Neural Comput. 8(4): 805-818 (1996) - [j14]Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger:
A Comparison of Two Lower-Bound Methods for Communication Complexity. Theor. Comput. Sci. 168(1): 39-51 (1996) - [c17]Juraj Hromkovic, Georg Schnitger:
Nondeterministic Communication with a Limited Number of Advice Bits. STOC 1996: 551-560 - 1995
- [j13]Jeff I. Chu, Georg Schnitger:
Communication Complexity of Matrix Computation over Finite Fields. Math. Syst. Theory 28(3): 215-228 (1995) - 1994
- [c16]Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger:
A Comparison of Two Lower Bound Methods for Communication Complexity. MFCS 1994: 326-335 - 1993
- [j12]Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán:
Two Tapes Versus One for Off-Line Turing Machines. Comput. Complex. 3: 392-401 (1993) - 1992
- [j11]Piotr Berman, Georg Schnitger:
On the Complexity of Approximating the Independent Set Problem. Inf. Comput. 96(1): 77-94 (1992) - [j10]Bala Kalyanasundaram, Georg Schnitger:
The Probabilistic Communication Complexity of Set Intersection. SIAM J. Discret. Math. 5(4): 545-557 (1992) - [j9]Piotr Berman, Ian Parberry, Georg Schnitger:
A note on the complexity of reliability in neural networks. IEEE Trans. Neural Networks 3(6): 998-1002 (1992) - [c15]Bhaskar DasGupta, Georg Schnitger:
The Power of Approximation: A Comparison of Activation Functions. NIPS 1992: 615-622 - [p1]Bala Kalyanasundaram, Georg Schnitger:
Communication Complexity and Lower Bounds for Sequential Computation. Informatik 1992: 253-268 - 1991
- [j8]Bala Kalyanasundaram, Georg Schnitger:
On the power of white pebbles. Comb. 11(2): 157-171 (1991) - [j7]Jeff I. Chu, Georg Schnitger:
The communication complexity of several problems in matrix computation. J. Complex. 7(4): 395-407 (1991) - [j6]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) - [c14]Wolfgang Maass, Georg Schnitger, Eduardo D. Sontag:
On the Computational Power of Sigmoid versus Boolean Threshold Circuits. FOCS 1991: 767-776 - 1990
- [j5]Bala Kalyanasundaram, Georg Schnitger:
Rounds Versus Time for the Two Person Pebble Game. Inf. Comput. 88(1): 1-17 (1990)
1980 – 1989
- 1989
- [j4]Ian Parberry, Georg Schnitger:
Relating Boltzmann machines to conventional models of computation. Neural Networks 2(1): 59-67 (1989) - [c13]Jeff I. Chu, Georg Schnitger:
The Communication Complexity of Several Problems in Matrix Computation. SPAA 1989: 22-31 - [c12]Piotr Berman, Georg Schnitger:
On the Complexity of Approximating the Independent Set Problem. STACS 1989: 256-268 - [c11]Bala Kalyanasundaram, Georg Schnitger:
Rounds versus Time for the Two Person Pebble Game (Extended Abstract). STACS 1989: 517-529 - 1988
- [j3]Ian Parberry, Georg Schnitger:
Parallel Computation with Threshold Functions. J. Comput. Syst. Sci. 36(3): 278-302 (1988) - [c10]Bala Kalyanasundaram, Georg Schnitger:
On the Power of White Pebbles (Extended Abstract). STOC 1988: 258-266 - 1987
- [j2]Pavol Duris, Zvi Galil, Georg Schnitger:
Lower Bounds on Communication Complexity. Inf. Comput. 73(1): 1-22 (1987) - [c9]Georg Schnitger, Bala Kalyanasundaram:
The probabilistic communication complexity of set intersection. SCT 1987: 41-47 - [c8]Ian Parberry, Georg Schnitger:
Relating Boltzmann Machines to Conventional Models of Computation. ISMIS 1987: 347-354 - [c7]Wolfgang Maass, Georg Schnitger, Endre Szemerédi:
Two Tapes Are Better than One for Off-Line Turing Machines. STOC 1987: 94-100 - 1986
- [c6]Wolfgang Maass, Georg Schnitger:
An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape. SCT 1986: 249-264 - [c5]Ian Parberry, Georg Schnitger:
Parallel Computation with Threshold Functions. SCT 1986: 272-290 - 1984
- [c4]Pavol Duris, Zvi Galil, Georg Schnitger:
Lower Bounds on Communication Complexity. STOC 1984: 81-91 - 1983
- [c3]Georg Schnitger:
On Depth-Reduction and Grates. FOCS 1983: 323-328 - 1982
- [b1]Georg Schnitger:
Elementare Analyse zweier probabilistischer Algorithmen und Tiefenreduktion azyklisch gerichteter Graphen. Bielefeld University, Germany, 1982, pp. 1-112 - [j1]Georg Schnitger:
A Family of Graphs with Expensive Depth Reduction. Theor. Comput. Sci. 18: 89-93 (1982) - [c2]Stefan Reisch, Georg Schnitger:
Three Applications of Kolmogorov-Complexity. FOCS 1982: 45-52 - 1981
- [c1]Georg Schnitger:
A Family of Graphs with Expensive Depth-Reduction. Theoretical Computer Science 1981: 91-97
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 01:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
