BibSonomy publications for /author/Geffert

An In-Place Sorting with On log n Comparisons and On Moves

dblp — 2011-12-05T00:00:00+01:00

Gianni Franceschini, and Viliam Geffert CoRR (2003)

Two-Way Automata Making Choices Only at the Endmarkers

dblp — 2011-12-05T00:00:00+01:00

Viliam Geffert, Bruno Guillon, and Giovanni Pighizzini CoRR (2011)

Hyper-Minimizing Minimized Deterministic Automata.

dblp — 2011-11-18T00:00:00+01:00

Viliam Geffert, Andrew Badr, and Ian Shipman AFL, page 9-30. (2008)

An Alternating Hierarchy for Finite Automata.

dblp — 2011-10-21T00:00:00+02:00

Viliam Geffert NCMA, volume 282 of books@ocg.at, page 15-36. Austrian Computer Society, (2011)

One Pebble Versus logn Bits.

dblp — 2011-10-21T00:00:00+02:00

Viliam Geffert, Carlo Mereghetti, and Giovanni Pighizzini NCMA, volume 256 of books@ocg.at, page 121-134. Austrian Computer Society, (2009)

Nondeterminism and the Size of One-Way Finite Automata.

dblp — 2011-10-21T00:00:00+02:00

Viliam Geffert DCFS, page 23-37. Università degli Studi di Milano, Milan, Italy, (2005)

An In-Place Sorting with On log n Comparisons and On Moves.

dblp — 2011-10-19T00:00:00+02:00

Gianni Franceschini, and Viliam Geffert FOCS, page 242-250. IEEE Computer Society, (2003)

Translation from classical two-way automata to pebble two-way automata.

dblp — 2011-09-20T00:00:00+02:00

Viliam Geffert, and Lubomíra Istonová RAIRO - Theor. Inf. and Applic. 44(4):507-523 (2010)

Nondeterministic Computations in Sublogarithmic Space and Space Constructibility.

dblp — 2011-09-12T00:00:00+02:00

Viliam Geffert SIAM J. Comput. 20(3):484-498 (1991)

Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space.

dblp — 2011-09-12T00:00:00+02:00

Viliam Geffert SIAM J. Comput. 22(1):102-113 (1993)

Sublogarithmic Bounds on Space and Reversals.

dblp — 2011-09-12T00:00:00+02:00

Viliam Geffert, Carlo Mereghetti, and Giovanni Pighizzini SIAM J. Comput. 28(1):325-340 (1998)

A Speed-Up Theorem Without Tape Compression.

dblp — 2011-09-07T00:00:00+02:00

Viliam Geffert Theor. Comput. Sci. 118(1):49-79 (1993)

A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient.

dblp — 2011-09-07T00:00:00+02:00

Viliam Geffert Theor. Comput. Sci. 62(3):235-249 (1988)

The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata.

dblp — 2011-08-16T00:00:00+02:00

Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, and Beatrice Palano DCFS, volume 6808 of Lecture Notes in Computer Science, page 80-92. Springer, (2011)

A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition.

dblp — 2011-07-08T00:00:00+02:00

Helmut Alt, Viliam Geffert, and Kurt Mehlhorn Inf. Process. Lett. 42(1):25-27 (1992)

Bridging Across the logn Space Frontier.

dblp — 2011-07-06T00:00:00+02:00

Viliam Geffert Inf. Comput. 142(2):127-158 (1998)

Converting Two-Way Nondeterministic Unary Automata into Simpler Automata.

dblp — 2011-06-28T00:00:00+02:00

Viliam Geffert, Carlo Mereghetti, and Giovanni Pighizzini MFCS, volume 2136 of Lecture Notes in Computer Science, page 398-407. Springer, (2001)

Space Hierarchy Theorem Revised.

dblp — 2011-06-28T00:00:00+02:00

Viliam Geffert MFCS, volume 2136 of Lecture Notes in Computer Science, page 387-397. Springer, (2001)

Two-way unary automata versus logarithmic space.

dblp — 2011-05-02T00:00:00+02:00

Viliam Geffert, and Giovanni Pighizzini Inf. Comput. 209(7):1016-1025 (2011)

One Pebble Versus epsilon * log n Bits.

dblp — 2011-01-06T00:00:00+01:00

Viliam Geffert, Giovanni Pighizzini, and Carlo Mereghetti Fundam. Inform. 104(1-2):55-69 (2010)