BibSonomy publications for /author/GeffertMon Dec 05 00:00:00 CET 2011CoRRAn In-Place Sorting with O(n log n) Comparisons and O(n) Movescs.DS/03050052003dblp Mon Dec 05 00:00:00 CET 2011CoRRTwo-Way Automata Making Choices Only at the Endmarkersabs/1110.12632011dblp Fri Nov 18 00:00:00 CET 2011AFLconf/afl/20089-30Hyper-Minimizing Minimized Deterministic Automata.2008dblp Fri Oct 21 00:00:00 CEST 2011NCMAconf/ncma/201115-36books@ocg.atAn Alternating Hierarchy for Finite Automata.2822011dblp Fri Oct 21 00:00:00 CEST 2011NCMAconf/ncma/2009121-134books@ocg.atOne Pebble Versus log(n) Bits.2562009dblp Fri Oct 21 00:00:00 CEST 2011DCFSconf/dcfs/200523-37(Non)determinism and the Size of One-Way Finite Automata.2005dblp Wed Oct 19 00:00:00 CEST 2011FOCSconf/focs/2003242-250An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.2003dblp Tue Sep 20 00:00:00 CEST 2011RAIRO - Theor. Inf. and Applic.4507-523Translation from classical two-way automata to pebble two-way automata.442010dblp Mon Sep 12 00:00:00 CEST 2011SIAM J. Comput.3484-498Nondeterministic Computations in Sublogarithmic Space and Space Constructibility.201991dblp Mon Sep 12 00:00:00 CEST 2011SIAM J. Comput.1102-113Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space.221993dblp Mon Sep 12 00:00:00 CEST 2011SIAM J. Comput.1325-340Sublogarithmic Bounds on Space and Reversals.281998dblp Wed Sep 07 00:00:00 CEST 2011Theor. Comput. Sci.149-79A Speed-Up Theorem Without Tape Compression.1181993dblp Wed Sep 07 00:00:00 CEST 2011Theor. Comput. Sci.3235-249A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient.621988dblp Tue Aug 16 00:00:00 CEST 2011DCFSconf/dcfs/201180-92Lecture Notes in Computer ScienceThe Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata.68082011dblp Fri Jul 08 00:00:00 CEST 2011Inf. Process. Lett.125-27A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.421992dblp Wed Jul 06 00:00:00 CEST 2011Inf. Comput.2127-158Bridging Across the log(n) Space Frontier.1421998dblp Tue Jun 28 00:00:00 CEST 2011MFCSconf/mfcs/2001398-407Lecture Notes in Computer ScienceConverting Two-Way Nondeterministic Unary Automata into Simpler Automata.21362001dblp Tue Jun 28 00:00:00 CEST 2011MFCSconf/mfcs/2001387-397Lecture Notes in Computer ScienceSpace Hierarchy Theorem Revised.21362001dblp Mon May 02 00:00:00 CEST 2011Inf. Comput.71016-1025Two-way unary automata versus logarithmic space.2092011dblp Thu Jan 06 00:00:00 CET 2011Fundam. Inform.1-255-69One Pebble Versus epsilon * log n Bits.1042010dblp