default search action
Jozef Gruska
Person information
- affiliation: Masaryk University, Brno, Czech Republic
- award (1996): Computer Pioneer Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j44]Shenggen Zheng
, Yaqiao Li, Minghua Pan, Jozef Gruska, Lvzhou Li:
Lifting query complexity to time-space complexity for two-way finite automata. J. Comput. Syst. Sci. 141: 103494 (2024) - 2023
- [i10]Shenggen Zheng, Yaqiao Li, Minghua Pan, Jozef Gruska, Lvzhou Li:
Lifting query complexity to time-space complexity for two-way finite automata. CoRR abs/2311.18220 (2023) - 2021
- [j43]Zhengwei Xie
Testing Boolean Functions Properties. Fundam. Informaticae 182(4): 321-344 (2021) - 2020
- [j42]Gang Chen, Le Wang, Wei Li, Yang Zhao, Sheng-Mei Zhao
Multiple-pulse phase-matching quantum key distribution. Quantum Inf. Process. 19(11): 416 (2020) - [j41]Fang Yu, Daowen Qiu, Xiaoming Wang, Qin Li
Security improvements of several basic quantum private query protocols with O(log N) communication complexity. Theor. Comput. Sci. 807: 330-340 (2020) - [i9]Fang Yu, Daowen Qiu, Xiaoming Wang, Qin Li, Lvzhou Li, Jozef Gruska:
Security Improvements of Several Basic Quantum Private Query Protocols with O(log N) Communication Complexity. CoRR abs/2005.13382 (2020)
2010 – 2019
- 2019
- [j40]Shiping Du, Daowen Qiu
Synthesis of quantum images using phase rotation. Quantum Inf. Process. 18(9): 286 (2019) - [j39]Minghua Pan, Daowen Qiu
Entangling and disentangling in Grover's search algorithm. Theor. Comput. Sci. 773: 138-152 (2019) - 2018
- [p3]Guoliang Xu
Improving the Success Probability for Shor's Factorization Algorithm. Reversibility and Universality 2018: 447-462 - 2017
- [j38]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Generalizations of the distributed Deutsch-Jozsa promise problem. Math. Struct. Comput. Sci. 27(3): 311-331 (2017) - [j37]Shenggen Zheng
Promise problems solved by quantum and classical finite automata. Theor. Comput. Sci. 666: 48-64 (2017) - [c30]Shenggen Zheng
Time-Space Complexity Advantages for Quantum Computing. TPNC 2017: 305-317 - 2016
- [j36]Jozef Gruska:
Rūsiņš Mārtiņš Freivalds. Remarkable Scholar, Unique Teacher and Great Man. Balt. J. Mod. Comput. 4(4) (2016) - 2015
- [j35]Shenggen Zheng
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. Inf. Comput. 241: 197-214 (2015) - [j34]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Potential of Quantum Finite Automata with Exact Acceptance. Int. J. Found. Comput. Sci. 26(3): 381-398 (2015) - [j33]Andris Ambainis, Jozef Gruska, Shenggen Zheng:
Exact quantum algorithms have advantage for almost all Boolean functions. Quantum Inf. Comput. 15(5&6): 435-452 (2015) - 2014
- [j32]Shenggen Zheng
On the state complexity of semi-quantum finite automata. RAIRO Theor. Informatics Appl. 48(2): 187-207 (2014) - [c29]Jozef Gruska:
Grand Challenges of Informatics. Computing with New Resources 2014: 449-461 - [c28]Shenggen Zheng, Jozef Gruska, Daowen Qiu:
On the State Complexity of Semi-quantum Finite Automata. LATA 2014: 601-612 - [i8]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Generalizations of the distributed Deutsch-Jozsa promise problem. CoRR abs/1402.7254 (2014) - [i7]Andris Ambainis, Jozef Gruska, Shenggen Zheng:
Exact query complexity of some special classes of Boolean functions. CoRR abs/1404.1684 (2014) - [i6]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Potential of quantum finite automata with exact acceptance. CoRR abs/1404.1689 (2014) - [i5]Jozef Gruska, Lvzhou Li, Shenggen Zheng:
Recognizability versus solvability of promise problems in finite, classical and quantum automata, framework. CoRR abs/1411.3870 (2014) - 2013
- [j31]Jozef Gruska:
New Vision and Goals of Informatics and Megachallenges of Mankind. Extended abstract. Comput. Sci. J. Moldova 21(3): 309-319 (2013) - [j30]Shenggen Zheng
State succinctness of two-way finite automata with quantum and classical states. Theor. Comput. Sci. 499: 98-112 (2013) - [c27]Jozef Gruska:
Roads to New Grand Challenges of Informatics - (Extended Abstract). Int. Conf. on Membrane Computing 2013: 10-18 - [i4]Shenggen Zheng, Jozef Gruska, Daowen Qiu:
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. CoRR abs/1304.3876 (2013) - [i3]Shenggen Zheng, Jozef Gruska, Daowen Qiu:
On the state complexity of semi-quantum finite automata. CoRR abs/1307.2499 (2013) - [i2]Jozef Gruska, Daowen Qiu, Shenggen Zheng:
Communication complexity of promise problems and their applications to finite automata. CoRR abs/1309.7739 (2013) - 2012
- [c26]Shenggen Zheng, Daowen Qiu, Lvzhou Li, Jozef Gruska:
One-Way Finite Automata with Quantum and Classical States. Languages Alive 2012: 273-290 - [r1]Daowen Qiu, Lvzhou Li, Paulo Mateus, Jozef Gruska:
Quantum Finite Automata. Handbook of Finite State Based Models and Applications 2012: 113-144 - 2011
- [j29]Daowen Qiu
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states. Acta Informatica 48(5-6): 271-290 (2011) - [c25]Jozef Gruska:
Roots and Stimuli to a New Perception of Informatics. Rainbow of Computer Science 2011: 184-199
2000 – 2009
- 2008
- [p2]Jozef Gruska:
Quantum Computing. Wiley Encyclopedia of Computer Science and Engineering 2008 - 2007
- [j28]Jozef Gruska, Salvatore La Torre, Mimmo Parente
The Firing Squad Synchronization Problem on Squares, Toruses and Rings. Int. J. Found. Comput. Sci. 18(3): 637-654 (2007) - [j27]Jozef Gruska:
A broader view on the limitations of information processing and communication by nature. Nat. Comput. 6(2): 75-112 (2007) - [c24]Jozef Gruska:
Algebraic Methods in Quantum Informatics. CAI 2007: 87-111 - 2006
- [j26]Jozef Gruska:
The Emergence and Challenges of Quantum Informatics (Entstehung der Quanteninformatik und ihre Herausforderungen). it Inf. Technol. 48(6): 336- (2006) - [j25]Jozef Gruska, Salvatore La Torre, Margherita Napoli
Different time solutions for the firing squad synchronization problem on basic grid networks. RAIRO Theor. Informatics Appl. 40(2): 177-206 (2006) - [c23]Jozef Gruska:
Universal Sets of Quantum Information Processing Primitives and Their Optimal Use. GTIT-C 2006: 425-451 - [c22]Jozef Gruska:
From Informatics to Quantum Informatics. IFIP TCS 2006: 5 - [c21]Jozef Gruska:
From Informatics to Quantum Informatics. IFIP TCS 2006: 17-46 - [p1]Jozef Gruska:
Quantum Finite Automata. Recent Advances in Formal Languages and Applications 2006: 81-117 - 2005
- [j24]Jozef Gruska:
Universal Sets of Quantum Information Processing Primitives and their optimal use. Electron. Notes Discret. Math. 21: 285-289 (2005) - [i1]Jozef Gruska, Salvatore La Torre, Margherita Napoli, Mimmo Parente:
Various Solutions to the Firing Squad Synchronization Problems. CoRR abs/cs/0511044 (2005) - 2004
- [c20]Jozef Gruska, Salvatore La Torre, Mimmo Parente:
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings. Developments in Language Theory 2004: 200-211 - 2003
- [j23]Jozef Gruska:
Invited Paper. Quantum Entanglement as a New Information Processing Resource. New Gener. Comput. 21(4): 279-295 (2003) - [c19]Jozef Gruska:
Succinctness in Quantum Information Processing. DCFS 2003: 15-25 - 2002
- [c18]Jozef Gruska, Hiroshi Imai, Keiji Matsumoto:
Power of Quantum Entanglement. IFIP TCS 2002: 3-22 - 2001
- [c17]Jozef Gruska, Hiroshi Imai:
Power, Puzzles and Properties of Entanglement. MCU 2001: 25-68 - 2000
- [j22]Jozef Gruska:
Book Review: foundations of computing. XRDS 6(5): 5 (2000) - [j21]Jozef Gruska:
Descriptional Complexity Issues in Quantum Computing. J. Autom. Lang. Comb. 5(3): 191-218 (2000) - [c16]Jozef Gruska, Roland Vollmar:
Quantum Finite Automata. Words, Languages & Combinatorics 2000: 192-211 - [c15]Jozef Gruska:
New Challenges for Theoretical Computer Science. IFIP TCS 2000: 599-601 - [c14]Jozef Gruska:
Quantumization of Theoretical Informatics. IFIP TCS 2000: 604-608
1990 – 1999
- 1999
- [c13]Jozef Gruska:
Quantum Challenges for Computing. ARCS 1999: 2 - [c12]Jozef Gruska:
Quantum Challenges. SOFSEM 1999: 1-28 - 1998
- [e4]Lubos Brim, Jozef Gruska, Jirí Zlatuska:
Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings. Lecture Notes in Computer Science 1450, Springer 1998, ISBN 3-540-64827-5 [contents] - 1997
- [j20]Jozef Gruska, Irène Guessarian:
Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations. J. Autom. Lang. Comb. 2(2): 93-133 (1997) - [j19]Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente:
Succinctness of Descriptions of SBTA-Languages. Theor. Comput. Sci. 179(1-2): 251-271 (1997) - [c11]Jozef Gruska, Roland Vollmar:
Towards Adjusting Informatics Education to Information Era. Foundations of Computer Science: Potential - Theory - Cognition 1997: 49-67 - [c10]Roland Vollmar, Jozef Gruska:
Informatics in curricula for noninformaticsstudents: engineering and science. Informatics in Higher Education 1997: 203-211 - 1995
- [j18]Emanuela Fachini, Jozef Gruska, Margherita Napoli
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata. Math. Syst. Theory 28(3): 245-266 (1995) - [c9]Jozef Gruska, Angelo Monti, Margherita Napoli, Domenico Parente:
State Complexity of SBTA Languages. LATIN 1995: 346-357 - 1994
- [c8]Jozef Gruska, Margherita Napoli, Domenico Parente:
Optimization of Systolic Tree Automata. IFIP Congress (1) 1994: 247-252 - [c7]Jozef Gruska, Irène Guessarian:
Correctness of Basic Systolic Systems Transformations. IFIP Congress (1) 1994: 315-321 - 1993
- [j17]Jozef Gruska, Margherita Napoli, Domenico Parente:
On the Minimization and Succintness of Systolic Binary Tree Automata. Sci. Ann. Cuza Univ. 2: 13-26 (1993) - 1990
- [j16]Emanuela Fachini, Jozef Gruska, Andrea Maggiolo-Schettini, Davide Sangiorgi:
Simulation of Systolic Tree Automata on Trellis Automata. Int. J. Found. Comput. Sci. 1(2): 87-110 (1990) - [j15]Jozef Gruska:
Synthesis, Structure and Power of Systolic Computations. Theor. Comput. Sci. 71(1): 47-77 (1990)
1980 – 1989
- 1988
- [c6]Jozef Gruska:
Systolic Architectures, Systems and Computations. ICALP 1988: 254-270 - 1986
- [j14]Karel Culík II, Jozef Gruska, Arto Salomaa:
Systolic Trellis Automata: Stability, Decidability and Complexity. Inf. Control. 71(3): 218-230 (1986) - [c5]Jozef Gruska:
Pragmatic Aspects of Complexity Theory (Panel). IFIP Congress 1986: 1-2 - [e3]Jozef Gruska, Branislav Rovan, Juraj Wiedermann
Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings. Lecture Notes in Computer Science 233, Springer 1986, ISBN 3-540-16783-8 [contents] - 1984
- [c4]Jozef Gruska:
Systolic Automata - Power, Characterizations, Nonhomogeneity. MFCS 1984: 32-49 - 1983
- [j13]Karel Culík II, Jozef Gruska, Arto Salomaa:
On a Family of L Languages Resulting from Systolic Tree Automata. Theor. Comput. Sci. 23: 231-242 (1983) - 1982
- [j12]Karel Culík II, Jozef Gruska, Arto Salomaa:
Systolic Automata for VLSI on Balanced Trees. Acta Informatica 18: 335-344 (1982) - 1981
- [e2]Jozef Gruska, Michal Chytil:
Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31 - September 4, 1981, Proceedings. Lecture Notes in Computer Science 118, Springer 1981, ISBN 3-540-10856-4 [contents]
1970 – 1979
- 1977
- [e1]Jozef Gruska:
Mathematical Foundations of Computer Science 1977, 6th Symposium, Tatranska Lomnica, Czechoslovakia, September 5-9, 1977, Proceedings. Lecture Notes in Computer Science 53, Springer 1977, ISBN 0-387-08353-7 [contents] - 1976
- [c3]Jozef Gruska:
Descriptional Complexity (of Languages) - A Short Survey. MFCS 1976: 65-80 - 1975
- [j11]Jozef Gruska:
A note on ε-rules in context-free grammars. Kybernetika 11(1): 26-31 (1975) - 1973
- [j10]Jozef Gruska:
Generalized context-free grammars. Acta Cybern. 2(1): 35-37 (1973) - [j9]Jozef Gruska:
On star height hierarchies of context-free languages. Kybernetika 9(4): 231-236 (1973) - [j8]Jozef Gruska:
Correction to: "On star height hierarchies of context-free languages". Kybernetika 9(6): 519 (1973) - [c2]Jozef Gruska:
Descriptional Complexity of Context-Free Languages. MFCS 1973: 71-83 - 1972
- [j7]Jozef Gruska:
On the size of context-free grammars. Kybernetika 8(3): 213-218 (1972) - 1971
- [j6]Jozef Gruska:
Complexity and Unambiguity of Context-Free Grammars and Languages. Inf. Control. 18(5): 502-519 (1971) - [j5]Jozef Gruska:
A Few Remarks on the Index of Context-Free Grammars and Languages. Inf. Control. 19(3): 216-223 (1971) - [j4]Jozef Gruska:
A Characterization of Context-free Languages. J. Comput. Syst. Sci. 5(4): 353-364 (1971)
1960 – 1969
- 1969
- [j3]Jozef Gruska:
Some Classifications of Context-Free Languages. Inf. Control. 14(2): 152-179 (1969) - 1968
- [c1]Jozef Gruska:
Unambiguity and ambiguity of context-free grammars and languages. IFIP Congress (1) 1968: 265-268 - 1967
- [j2]Jozef Gruska:
On a classification of context-free languages. Kybernetika 3(1): 22-29 (1967) - 1966
- [j1]Jozef Gruska:
On sets generated by context-free grammars. Kybernetika 2(6): 483-493 (1966)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: