Viliam Geffert - Concepedia

Author

Viliam Geffert

University of Pavol Jozef Šafárik ORCID

Also Known As

Geffert, Viliam, V. Geffert, VILIAM GEFFERT, Viliam Geffert, Viliam Geffert, et al.

100

Publications

Citations

H-Index

Concepts

All Affiliations

University of Pavol Jozef Šafárik University of Milan University of Pisa

About

Viliam Geffert is an author at University of Pavol Jozef Šafárik specializing in engineering, computer science, and formal methods.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	15	18	557
2	Computer Science	15	16	492
3	Linguistics	3	3	63
4	Language Studies	2	2	50
5	Computer Engineering	2	2	38

Viliam Geffert

Publications

752

Citations

H-Index

Page 1

	Year	Citations
Normal forms for phrase-structure grammars Viliam Geffert RAIRO - Theoretical Informatics and Applications	1991	83
Converting two-way nondeterministic unary automata into simpler automata Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini Theoretical Computer Science Logical AutomatonEngineeringAutomated ReasoningFormal MethodsPushdown Automaton	2003	72
Complementing two-way finite automata Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini Information and Computation Logical AutomatonEngineeringAutomated ReasoningFormal MethodsPushdown Automaton	2007	57
Magic numbers in the state hierarchy of finite automata Viliam Geffert Information and Computation Logical AutomatonEngineeringAutomated ReasoningFormal MethodsAutomaton Operation	2007	54
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility Viliam Geffert SIAM Journal on Computing Theory Of ComputingMemory Limited ComputationsComputational Complexity TheoryEngineeringOpen Problem	1991	47
Asymptotically efficient in-place merging Viliam Geffert, Jyrki Katajainen, Tomi Pasanen Theoretical Computer Science Mathematical ProgrammingEngineeringEfficient In-place MergingApproximate ComputingRandomized Algorithm	2000	39
More concise representation of regular languages by automata and regular expressions Viliam Geffert, Carlo Mereghetti, Beatrice Palano Information and Computation SyntaxEngineeringFormal LanguageLogical AutomatonAutomated Reasoning	2010	37
Hyper-minimizing minimized deterministic finite state automata Andrew Badr, Viliam Geffert, Ian Shipman RAIRO - Theoretical Informatics and Applications EngineeringQuantum AutomatonAutomated ReasoningFormal MethodsFinite State Transducers	2007	35
Two-way unary automata versus logarithmic space Viliam Geffert, Giovanni Pighizzini Information and Computation Logical AutomatonEngineeringAutomated ReasoningEntropyFormal Methods	2011	28
Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space Viliam Geffert SIAM Journal on Computing Theory Of ComputingComputational Complexity TheoryEngineeringSingle-letter AlphabetNondeterministic Turing Machine	1993	27

Page 1