sign in · help · news · about ·

BibSonomy :: author :: Geffert ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

>
|
<

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(56)

<< < 1 | 2 | 3 > >>

An In-Place Sorting with On log n Comparisons and On Moves
Gianni Franceschini, and Viliam Geffert CoRR (2003)
to dblp by dblp and 1 other user on Dec 5, 2011, 12:00 AM
URL | BibTeX
Two-Way Automata Making Choices Only at the Endmarkers
Viliam Geffert, Bruno Guillon, and Giovanni Pighizzini CoRR (2011)
to dblp by dblp on Dec 5, 2011, 12:00 AM
URL | BibTeX
Hyper-Minimizing Minimized Deterministic Automata.
Viliam Geffert, Andrew Badr, and Ian Shipman AFL, page 9-30. (2008)
to dblp by dblp on Nov 18, 2011, 12:00 AM
URL | BibTeX
An Alternating Hierarchy for Finite Automata.
Viliam Geffert NCMA, volume 282 of books@ocg.at, page 15-36. Austrian Computer Society, (2011)
to dblp by dblp on Oct 21, 2011, 12:00 AM
URL | BibTeX
One Pebble Versus logn Bits.
Viliam Geffert, Carlo Mereghetti, and Giovanni Pighizzini NCMA, volume 256 of books@ocg.at, page 121-134. Austrian Computer Society, (2009)
to dblp by dblp on Oct 21, 2011, 12:00 AM
URL | BibTeX
Nondeterminism and the Size of One-Way Finite Automata.
Viliam Geffert DCFS, page 23-37. Università degli Studi di Milano, Milan, Italy, (2005)
to dblp by dblp on Oct 21, 2011, 12:00 AM
URL | BibTeX
An In-Place Sorting with On log n Comparisons and On Moves.
Gianni Franceschini, and Viliam Geffert FOCS, page 242-250. IEEE Computer Society, (2003)
to dblp by dblp and 1 other user on Oct 19, 2011, 12:00 AM
URL | BibTeX
Translation from classical two-way automata to pebble two-way automata.
Viliam Geffert, and Lubomíra Istonová RAIRO - Theor. Inf. and Applic. 44(4):507-523 (2010)
to dblp by dblp on Sep 20, 2011, 12:00 AM
URL | BibTeX
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility.
Viliam Geffert SIAM J. Comput. 20(3):484-498 (1991)
to dblp by dblp on Sep 12, 2011, 12:00 AM
URL | BibTeX
Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space.
Viliam Geffert SIAM J. Comput. 22(1):102-113 (1993)
to dblp by dblp on Sep 12, 2011, 12:00 AM
URL | BibTeX
Sublogarithmic Bounds on Space and Reversals.
Viliam Geffert, Carlo Mereghetti, and Giovanni Pighizzini SIAM J. Comput. 28(1):325-340 (1998)
to dblp by dblp on Sep 12, 2011, 12:00 AM
URL | BibTeX
A Speed-Up Theorem Without Tape Compression.
Viliam Geffert Theor. Comput. Sci. 118(1):49-79 (1993)
to dblp by dblp on Sep 7, 2011, 12:00 AM
URL | BibTeX
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient.
Viliam Geffert Theor. Comput. Sci. 62(3):235-249 (1988)
to dblp by dblp on Sep 7, 2011, 12:00 AM
URL | BibTeX
The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata.
Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, and Beatrice Palano DCFS, volume 6808 of Lecture Notes in Computer Science, page 80-92. Springer, (2011)
to dblp by dblp on Aug 16, 2011, 12:00 AM
URL | BibTeX
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.
Helmut Alt, Viliam Geffert, and Kurt Mehlhorn Inf. Process. Lett. 42(1):25-27 (1992)
to dblp by dblp on Jul 8, 2011, 12:00 AM
URL | BibTeX
Bridging Across the logn Space Frontier.
Viliam Geffert Inf. Comput. 142(2):127-158 (1998)
to dblp by dblp on Jul 6, 2011, 12:00 AM
URL | BibTeX
Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.
Viliam Geffert, Carlo Mereghetti, and Giovanni Pighizzini MFCS, volume 2136 of Lecture Notes in Computer Science, page 398-407. Springer, (2001)
to dblp by dblp on Jun 28, 2011, 12:00 AM
URL | BibTeX
Space Hierarchy Theorem Revised.
Viliam Geffert MFCS, volume 2136 of Lecture Notes in Computer Science, page 387-397. Springer, (2001)
to dblp by dblp on Jun 28, 2011, 12:00 AM
URL | BibTeX
Two-way unary automata versus logarithmic space.
Viliam Geffert, and Giovanni Pighizzini Inf. Comput. 209(7):1016-1025 (2011)
to dblp by dblp on May 2, 2011, 12:00 AM
URL | BibTeX
One Pebble Versus epsilon * log n Bits.
Viliam Geffert, Giovanni Pighizzini, and Carlo Mereghetti Fundam. Inform. 104(1-2):55-69 (2010)
to dblp by dblp on Jan 6, 2011, 12:00 AM
URL | BibTeX

<< < 1 | 2 | 3 > >>publications per page: 5 10 20 50 100

a gripper