BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Austria
1 × Czech Republic
1 × Japan
1 × Portugal
1 × Switzerland
1 × The Netherlands
4 × USA
Collaborated with:
J.Hromkovic B.Kalyanasundaram W.Maass E.Szemerédi P.Duris Z.Galil J.Karhumäki H.Klauck S.Seibert
Talks about:
automata (5) power (3) finit (3) two (3) nondetermin (2) pushdown (2) determin (2) communic (2) machin (2) lower (2)

Person: Georg Schnitger

DBLP DBLP: Schnitger:Georg

Contributed to:

DLT 20082008
ICALP 20052005
ICALP 20032003
DLT 20012001
ICALP 20002000
ICALP 19991999
STOC 19961996
STOC 19881988
STOC 19871987
STOC 19841984

Wrote 11 papers:

DLT-2008-HromkovicS #automaton #bound #nondeterminism #on the #proving
On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (JH, GS), pp. 34–55.
NFAs With and Without epsilon-Transitions (JH, GS), pp. 385–396.
ICALP-2003-HromkovicS #automaton #comparison #multi
Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes (JH, GS), pp. 66–80.
ICALP-2003-HromkovicS03a #automaton #finite #nondeterminism
Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser’s Separation (JH, GS), pp. 439–451.
DLT-2001-HromkovicS #automaton #on the #power of #random
On the Power of Randomized Pushdown Automata (JH, GS), pp. 262–271.
ICALP-2000-HromkovicKKSS #automaton #finite #metric #nondeterminism
Measures of Nondeterminism in Finite Automata (JH, JK, HK, GS, SS), pp. 199–210.
ICALP-1999-HromkovicS #automaton #finite #on the #power of
On the Power of Las Vegas II. Two-Way Finite Automata (JH, GS), pp. 433–442.
STOC-1996-HromkovicS #communication #nondeterminism
Nondeterministic Communication with a Limited Number of Advice Bits (JH, GS), pp. 551–560.
STOC-1988-KalyanasundaramS #on the #power of
On the Power of White Pebbles (BK, GS), pp. 258–266.
STOC-1987-MaassSS #turing machine
Two Tapes Are Better than One for Off-Line Turing Machines (WM, GS, ES), pp. 94–100.
STOC-1984-DurisGS #bound #communication #complexity
Lower Bounds on Communication Complexity (PD, ZG, GS), pp. 81–91.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.