http://www.bibsonomy.org/burst/author/GeffertBibSonomy RSS feed for /author/Geffert2010-03-20T22:46:29+01:00http://www.bibsonomy.org/bibtex/2b3a01e77cfcd0fffd895cc71540818fd/dblpdblp2009-11-20T00:00:00+01:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Lubom&#237;ra <a href="http://www.bibsonomy.org/author/Istonová">Istonov&#225;</a> </span><em>ITA</em><em>40(4):611-629</em>(<em>2006</em>)Fri Nov 20 00:00:00 CET 2009ITA4611-629Conversion of regular expressions into realtime automata.402006dblp dblphttp://www.bibsonomy.org/bibtex/2e2baa9f3a6ed754a6c4c71477d8e5add/dblpdblp2009-11-20T00:00:00+01:00dblp <span style="color:#555555;">Andrew <a href="http://www.bibsonomy.org/author/Badr">Badr</a> and Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Ian <a href="http://www.bibsonomy.org/author/Shipman">Shipman</a> </span><em>ITA</em><em>43(1):69-94</em>(<em>2009</em>)Fri Nov 20 00:00:00 CET 2009ITA169-94Hyper-minimizing minimized deterministic finite state automata.432009dblp dblphttp://www.bibsonomy.org/bibtex/2d65f135659e27b9fff73ce8a301b9f35/dblpdblp2009-10-12T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Jozef <a href="http://www.bibsonomy.org/author/Gajdos">Gajdos</a> </span><em>FCT, </em><em>volume 5699 of Lecture Notes in Computer Science, </em><em>page 133-144. </em><em>Springer, </em>(<em>2009</em>)Mon Oct 12 00:00:00 CEST 2009FCTconf/fct/2009133-144Lecture Notes in Computer ScienceMultiway In-Place Merging.56992009dblp dblphttp://www.bibsonomy.org/bibtex/24ba569f2a964b6e4f27fb31f59539132/dblpdblp2009-09-21T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>MFCS, </em><em>volume 324 of Lecture Notes in Computer Science, </em><em>page 309-317. </em><em>Springer, </em>(<em>1988</em>)Mon Sep 21 00:00:00 CEST 2009MFCSconf/mfcs/1988309-317Lecture Notes in Computer ScienceContext-Free-Like Forms for the Phrase-Structure Grammars.3241988dblp dblphttp://www.bibsonomy.org/bibtex/21ba62b6562b878d98d82c05dabc663b0/dblpdblp2009-09-21T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>MFCS, </em><em>volume 233 of Lecture Notes in Computer Science, </em><em>page 370-378. </em><em>Springer, </em>(<em>1986</em>)Mon Sep 21 00:00:00 CEST 2009MFCSconf/mfcs/1986370-378Lecture Notes in Computer ScienceGrammars with Context Dependency Restricted to Synchronization.2331986dblp dblphttp://www.bibsonomy.org/bibtex/273260fe50528afe4505cc0cd1aa8830e/dblpdblp2009-09-21T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>MFCS, </em><em>volume 969 of Lecture Notes in Computer Science, </em><em>page 50-65. </em><em>Springer, </em>(<em>1995</em>)Mon Sep 21 00:00:00 CEST 2009MFCSconf/mfcs/199550-65Lecture Notes in Computer ScienceBridging Across the log(n) Space Frontier.9691995dblp dblphttp://www.bibsonomy.org/bibtex/2762c6c54a524c93567860d1e76109a71/dblpdblp2009-09-21T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>MFCS, </em><em>volume 452 of Lecture Notes in Computer Science, </em><em>page 285-291. </em><em>Springer, </em>(<em>1990</em>)Mon Sep 21 00:00:00 CEST 2009MFCSconf/mfcs/1990285-291Lecture Notes in Computer ScienceSpeed-Up Theorem Without Tape Compression.4521990dblp dblphttp://www.bibsonomy.org/bibtex/2a59d4a18638d80a213283f8a18e03070/dblpdblp2009-09-19T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>ICALP, </em><em>volume 443 of Lecture Notes in Computer Science, </em><em>page 111-124. </em><em>Springer, </em>(<em>1990</em>)Sat Sep 19 00:00:00 CEST 2009ICALPconf/icalp/1990111-124Lecture Notes in Computer ScienceNondeterministic Computations in Sublogarithmic Space and Space Constructibility.4431990dblp dblphttp://www.bibsonomy.org/bibtex/23504b061c16cc78d039be4f430f1bcd4/dblpdblp2009-08-19T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Lubom&#237;ra <a href="http://www.bibsonomy.org/author/Istonová">Istonov&#225;</a> </span><em>CoRR</em>(<em>2009</em>) <em>informal publication . </em>Wed Aug 19 00:00:00 CEST 2009CoRRinformal publicationTranslation from Classical Two-Way Automata to Pebble Two-Way Automataabs/0907.51272009dblp dblphttp://www.bibsonomy.org/bibtex/238da539087a75027f46338de2fe0a3cf/dblpdblp2009-01-26T00:00:00+01:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Dana <a href="http://www.bibsonomy.org/author/Pardubská">Pardubsk&#225;</a> </span><em>SOFSEM, </em><em>volume 5404 of Lecture Notes in Computer Science, </em><em>page 291-302. </em><em>Springer, </em>(<em>2009</em>)Mon Jan 26 00:00:00 CET 2009SOFSEMconf/sofsem/2009291-302Lecture Notes in Computer ScienceFactoring and Testing Primes in Small Space.54042009dblp dblphttp://www.bibsonomy.org/bibtex/2ccfa815511d97a3ee7c82afea5bd7b99/dblpdblp2008-12-17T00:00:00+01:00dblp <span style="color:#555555;">Brian T. <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>Information Systems Security</em><em>13(5):21-28</em>(<em>2004</em>)Wed Dec 17 00:00:00 CET 2008Information Systems Security521-28Incorporating HIPAA Security Requirements into an Enterprise Security Program.132004dblp dblphttp://www.bibsonomy.org/bibtex/271ee0918195f725fd67254da039e267e/dblpdblp2008-11-05T00:00:00+01:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Giovanni <a href="http://www.bibsonomy.org/author/Pighizzini">Pighizzini</a> </span><em>Int. J. Found. Comput. Sci.</em><em>19(4):747-749</em>(<em>2008</em>)Wed Nov 05 00:00:00 CET 2008Int. J. Found. Comput. Sci.4747-749Preface.192008dblp dblphttp://www.bibsonomy.org/bibtex/227fcac2d9a5e42ab4d81a1357a9efd97/dblpdblp2008-09-12T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Carlo <a href="http://www.bibsonomy.org/author/Mereghetti">Mereghetti</a> and Beatrice <a href="http://www.bibsonomy.org/author/Palano">Palano</a> </span><em>Developments in Language Theory, </em><em>volume 5257 of Lecture Notes in Computer Science, </em><em>page 359-370. </em><em>Springer, </em>(<em>2008</em>)Fri Sep 12 00:00:00 CEST 2008Developments in Language Theoryconf/dlt/2008359-370Lecture Notes in Computer ScienceMore Concise Representation of Regular Languages by Automata and Regular Expressions.52572008dblp dblphttp://www.bibsonomy.org/bibtex/28de9de47d17978b0d18131a96c30cd0d/dblpdblp2008-03-04T00:00:00+01:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>Inf. Comput.</em><em>205(11):1652-1670</em>(<em>2007</em>)Tue Mar 04 00:00:00 CET 2008Inf. Comput.111652-1670Magic numbers in the state hierarchy of finite automata.2052007dblp dblphttp://www.bibsonomy.org/bibtex/250c5ce112314e68eb864e874de7d4756/dblpdblp2008-01-02T00:00:00+01:00dblp <span style="color:#555555;">Gianni <a href="http://www.bibsonomy.org/author/Franceschini">Franceschini</a> and Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>CoRR</em>(<em>2003</em>) <em>informal publication . </em>Wed Jan 02 00:00:00 CET 2008CoRRinformal publicationAn In-Place Sorting with O(n log n) Comparisons and O(n) Movescs.DS/03050052003dblp dblphttp://www.bibsonomy.org/bibtex/25cb529c98c8ae7f566054044db7c1f1b/dblpdblp2007-10-04T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Carlo <a href="http://www.bibsonomy.org/author/Mereghetti">Mereghetti</a> and Giovanni <a href="http://www.bibsonomy.org/author/Pighizzini">Pighizzini</a> </span><em>Inf. Comput.</em><em>205(8):1173-1187</em>(<em>2007</em>)Thu Oct 04 00:00:00 CEST 2007Inf. Comput.81173-1187Complementing two-way finite automata.2052007dblp dblphttp://www.bibsonomy.org/bibtex/2f077296f5fe91d6288f4e23d32adcadb/dblpdblp2007-05-16T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and J&#225;n <a href="http://www.bibsonomy.org/author/Kollár">Koll&#225;r</a> </span><em>Computers and Artificial Intelligence</em>(<em>2006</em>)Wed May 16 00:00:00 CEST 2007Computers and Artificial Intelligence4Linear-Time In-Place Selection with epsilon.n Element Moves.252006dblp dblphttp://www.bibsonomy.org/bibtex/2aa7d19fa92206b7d01035e476094371a/dblpdblp2007-05-15T00:00:00+02:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> and Norbert <a href="http://www.bibsonomy.org/author/Popély">Pop&#233;ly</a> </span><em>Computers and Artificial Intelligence</em>(<em>2002</em>)Tue May 15 00:00:00 CEST 2007Computers and Artificial Intelligence6Refinement of the Alternating Space Hierarchy.212002dblp dblphttp://www.bibsonomy.org/bibtex/2c3ff07167374f636d71a539bb87ef641/dblpdblp2006-11-22T00:00:00+01:00dblp <span style="color:#555555;">Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>MFCS, </em><em>volume 4162 of Lecture Notes in Computer Science, </em><em>page 412-423. </em><em>Springer, </em>(<em>2006</em>)Wed Nov 22 00:00:00 CET 2006MFCSconf/mfcs/2006412-423Lecture Notes in Computer ScienceMagic Numbers in the State Hierarchy of Finite Automata.41622006dblp dblphttp://www.bibsonomy.org/bibtex/2ef50b3233b0e2bdc2f6547892567c438/dblpdblp2006-02-10T00:00:00+01:00dblp <span style="color:#555555;">Gianni <a href="http://www.bibsonomy.org/author/Franceschini">Franceschini</a> and Viliam <a href="http://www.bibsonomy.org/author/Geffert">Geffert</a> </span><em>J. ACM</em><em>52(4):515-537</em>(<em>2005</em>)Fri Feb 10 00:00:00 CET 2006J. ACM4515-537An in-place sorting with O(nlog n) comparisons and O(n) moves.522005dblp dblp