The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Viliam Geffert: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
    Complementing Two-Way Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:260-271 [Conf]
  2. Gianni Franceschini, Viliam Geffert
    An In-Place Sorting with O(n log n) Comparisons and O(n) Moves. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:242-250 [Conf]
  3. Viliam Geffert
    Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:111-124 [Conf]
  4. Viliam Geffert
    Space Hierarchy Theorem Revised. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:387-397 [Conf]
  5. Viliam Geffert
    Magic Numbers in the State Hierarchy of Finite Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:412-423 [Conf]
  6. Viliam Geffert
    Grammars with Context Dependency Restricted to Synchronization. [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:370-378 [Conf]
  7. Viliam Geffert
    Context-Free-Like Forms for the Phrase-Structure Grammars. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:309-317 [Conf]
  8. Viliam Geffert
    Speed-Up Theorem Without Tape Compression. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:285-291 [Conf]
  9. Viliam Geffert
    Bridging Across the log(n) Space Frontier. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:50-65 [Conf]
  10. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
    Converting Two-Way Nondeterministic Unary Automata into Simpler Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:398-407 [Conf]
  11. Viliam Geffert, Norbert Popély
    Refinement of the Alternating Space Hierarchy. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2002, v:21, n:6, pp:- [Journal]
  12. Viliam Geffert, Ján Kollár
    Linear-Time In-Place Selection with epsilon.n Element Moves. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 2006, v:25, n:4, pp:- [Journal]
  13. Gianni Franceschini, Viliam Geffert
    An In-Place Sorting with O(n log n) Comparisons and O(n) Moves [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  14. Viliam Geffert
    How to Generate Languages Using Only Two Pairs of Parentheses. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1991, v:27, n:5/6, pp:303-315 [Journal]
  15. Viliam Geffert
    Bridging Across the log(n) Space Frontier. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:142, n:2, pp:127-158 [Journal]
  16. Helmut Alt, Viliam Geffert, Kurt Mehlhorn
    A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:25-27 [Journal]
  17. Viliam Geffert
    Normal forms for phrase-structure grammars. [Citation Graph (0, 0)][DBLP]
    ITA, 1991, v:25, n:, pp:473-498 [Journal]
  18. Viliam Geffert
    Sublogarithmic Sigma2-Space is not Closed under Complement and Other Separation Results. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:4, pp:349-366 [Journal]
  19. Viliam Geffert
    A Hierarchy That Does Not Collapse: Alternations in Low Level Space. [Citation Graph (0, 0)][DBLP]
    ITA, 1994, v:28, n:5, pp:465-512 [Journal]
  20. Viliam Geffert, Norbert Popély
    A space lower bound for acceptance by one-way II2-alternating machines. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:5, pp:357-372 [Journal]
  21. Gianni Franceschini, Viliam Geffert
    An in-place sorting with O(nlog n) comparisons and O(n) moves. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2005, v:52, n:4, pp:515-537 [Journal]
  22. Viliam Geffert
    Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:66, n:3, pp:451-472 [Journal]
  23. Viliam Geffert
    Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:3, pp:484-498 [Journal]
  24. Viliam Geffert
    Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:102-113 [Journal]
  25. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
    Sublogarithmic Bounds on Space and Reversals. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:325-340 [Journal]
  26. Viliam Geffert
    A variant of inductive counting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:465-475 [Journal]
  27. Viliam Geffert
    Space hierarchy theorem revised. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:171-187 [Journal]
  28. Viliam Geffert
    A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:62, n:3, pp:235-249 [Journal]
  29. Viliam Geffert
    A Speed-Up Theorem Without Tape Compression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:118, n:1, pp:49-79 [Journal]
  30. Viliam Geffert
    A Communication Hierarchy of Parallel Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:198, n:1-2, pp:99-130 [Journal]
  31. Viliam Geffert, Jyrki Katajainen, Tomi Pasanen
    Asymptotically efficient in-place merging. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:159-181 [Journal]
  32. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
    Converting two-way nondeterministic unary automata into simpler automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:189-203 [Journal]
  33. Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
    Complementing two-way finite automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:8, pp:1173-1187 [Journal]

  34. More Concise Representation of Regular Languages by Automata and Regular Expressions. [Citation Graph (, )][DBLP]


  35. Two-Way Unary Automata versus Logarithmic Space. [Citation Graph (, )][DBLP]


  36. Multiway In-Place Merging. [Citation Graph (, )][DBLP]


  37. Pairs of Complementary Unary Languages with "Balanced" Nondeterministic Automata. [Citation Graph (, )][DBLP]


  38. Factoring and Testing Primes in Small Space. [Citation Graph (, )][DBLP]


  39. Translation from Classical Two-Way Automata to Pebble Two-Way Automata [Citation Graph (, )][DBLP]


Search in 0.035secs, Finished in 0.036secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002