To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

How to transfigure the Wikipedia

Would you like Wikipedia to always look as professional and up-to-date? We have created a browser extension. It will enhance any encyclopedic page you visit with the magic of the WIKI 2 technology.

Try it — you can delete it anytime.

Install in 5 seconds
4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
Great Wikipedia has got greater.
.
Leo
Newton
Brights
Milds

Viliam Geffert

From Wikipedia, the free encyclopedia

Viliam Geffert
Born1955 (age 68–69)
Alma materP. J. Šafárik University, Comenius University
Known forstate complexity, small-space complexity
Scientific career
FieldsAutomata theory, computational complexity
InstitutionsP. J. Šafárik University

Viliam Geffert (born 1955) is a Slovak theoretical computer scientist known for his contributions to the computational complexity theory in sublogarithmic space[1][2] and to the state complexity of two-way finite automata.[3][4] He has also developed new in-place sorting algorithms.[5][6] He is a professor and the head of the computer science department at the P. J. Šafárik University in Košice.

Biography

Geffert did his undergraduate studies at the P. J. Šafárik University, graduating in 1979. He earned his PhD degree in 1988 from the Comenius University in Bratislava. Since 2003, he is a full professor of the P. J. Šafárik University.

References

  1. ^ Geffert, Viliam (1993). "Tally Versions of the Savitch and Immerman–Szelepcsényi Theorems for Sublogarithmic Space". SIAM Journal on Computing. 22 (1): 102–113. doi:10.1137/0222009. ISSN 0097-5397.
  2. ^ Geffert, Viliam; Mereghetti, Carlo; Pighizzini, Giovanni (1998). "Sublogarithmic Bounds on Space and Reversals". SIAM Journal on Computing. 28 (1): 325–340. doi:10.1137/S0097539796301306. hdl:2434/178756. ISSN 0097-5397. S2CID 37853723.
  3. ^ Geffert, Viliam (2012). "An alternating hierarchy for finite automata". Theoretical Computer Science. 445: 1–24. doi:10.1016/j.tcs.2012.04.044. ISSN 0304-3975.
  4. ^ Geffert, Viliam; Mereghetti, Carlo; Pighizzini, Giovanni (2007). "Complementing two-way finite automata". Information and Computation. 205 (8): 1173–1187. doi:10.1016/j.ic.2007.01.008. ISSN 0890-5401.
  5. ^ Franceschini, Gianni; Geffert, Viliam (2005). "An in-place sorting with O(nlog n) comparisons and O(n) moves". Journal of the ACM. 52 (4): 515–537. arXiv:cs/0305005. doi:10.1145/1082036.1082037. ISSN 0004-5411. S2CID 2148080.
  6. ^ Geffert, Viliam; Gajdoš, Jozef (2011). "In-Place Sorting". SOFSEM 2011: Theory and Practice of Computer Science. Lecture Notes in Computer Science. Vol. 6543. pp. 248–259. Bibcode:2011LNCS.6543..248G. doi:10.1007/978-3-642-18381-2_21. ISBN 978-3-642-18380-5. ISSN 0302-9743.

External links

This page was last edited on 18 February 2023, at 17:10
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.
Contact WIKI 2
Introduction
Terms of Service
Privacy Policy