Jozef Gruska

According to our database1, Jozef Gruska authored at least 68 papers between 1966 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Improving the Success Probability for Shor's Factorization Algorithm.
Proceedings of the Reversibility and Universality, 2018

2017
Promise problems solved by quantum and classical finite automata.
Theor. Comput. Sci., 2017

Generalizations of the distributed Deutsch-Jozsa promise problem.
Mathematical Structures in Computer Science, 2017

Time-Space Complexity Advantages for Quantum Computing.
Proceedings of the Theory and Practice of Natural Computing - 6th International Conference, 2017

2015
Exact quantum algorithms have advantage for almost all Boolean functions.
Quantum Information & Computation, 2015

Potential of Quantum Finite Automata with Exact Acceptance.
Int. J. Found. Comput. Sci., 2015

Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata.
Inf. Comput., 2015

2014
On the State Complexity of Semi-quantum Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2014

Grand Challenges of Informatics.
Proceedings of the Computing with New Resources, 2014

2013
State succinctness of two-way finite automata with quantum and classical states.
Theor. Comput. Sci., 2013

New Vision and Goals of Informatics and Megachallenges of Mankind. Extended abstract.
The Computer Science Journal of Moldova, 2013

Roads to New Grand Challenges of Informatics - (Extended Abstract).
Proceedings of the Membrane Computing, 2013

2012
Quantum Finite Automata.
Proceedings of the Handbook of Finite State Based Models and Applications., 2012

One-Way Finite Automata with Quantum and Classical States.
Proceedings of the Languages Alive, 2012

2011
Multi-letter quantum finite automata: decidability of the equivalence and minimization of states.
Acta Inf., 2011

Roots and Stimuli to a New Perception of Informatics.
Proceedings of the Rainbow of Computer Science, 2011

2008
Quantum Computing.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

2007
A broader view on the limitations of information processing and communication by nature.
Natural Computing, 2007

The Firing Squad Synchronization Problem on Squares, Toruses and Rings.
Int. J. Found. Comput. Sci., 2007

Algebraic Methods in Quantum Informatics.
Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006
Quantum Finite Automata.
Proceedings of the Recent Advances in Formal Languages and Applications, 2006

Different time solutions for the firing squad synchronization problem on basic grid networks.
ITA, 2006

The Emergence and Challenges of Quantum Informatics (Entstehung der Quanteninformatik und ihre Herausforderungen).
it - Information Technology, 2006

From Informatics to Quantum Informatics.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

From Informatics to Quantum Informatics.
Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

Universal Sets of Quantum Information Processing Primitives and Their Optimal Use.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2004
Optimal Time and Communication Solutions of Firing Squad Synchronization Problems on Square Arrays, Toruses and Rings.
Proceedings of the Developments in Language Theory, 2004

2003
Invited Paper. Quantum Entanglement as a New Information Processing Resource.
New Generation Comput., 2003

Succinctness in Quantum Information Processing.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2002
Power of Quantum Entanglement.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
Power, Puzzles and Properties of Entanglement.
Proceedings of the Machines, 2001

2000
Descriptional Complexity Issues in Quantum Computing.
Journal of Automata, Languages and Combinatorics, 2000

Quantumization of Theoretical Informatics.
Proceedings of the Theoretical Computer Science, 2000

New Challenges for Theoretical Computer Science.
Proceedings of the Theoretical Computer Science, 2000

Quantum Finite Automata.
Proceedings of the International Colloquium on Words, 2000

1999
Quantum Challenges.
Proceedings of the SOFSEM '99, Theory and Practice of Informatics, 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27, 1999

Quantum Challenges for Computing.
Proceedings of the Architektur von Rechensystemen, Systemarchitektur auf dem Weg ins 3. Jahrtausend: Neue Strukturen, Konzepte, Verfahren und Bewertungsmethoden, 1999

1997
Succinctness of Descriptions of SBTA-Languages.
Theor. Comput. Sci., 1997

Fixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations.
Journal of Automata, Languages and Combinatorics, 1997

Informatics in curricula for noninformaticsstudents: engineering and science.
Proceedings of the Informatics in Higher Education, 1997

Towards Adjusting Informatics Education to Information Era.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1995
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata.
Mathematical Systems Theory, 1995

State Complexity of SBTA Languages.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994
Optimization of Systolic Tree Automata.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

Correctness of Basic Systolic Systems Transformations.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
On the Minimization and Succintness of Systolic Binary Tree Automata.
Sci. Ann. Cuza Univ., 1993

1990
Synthesis, Structure and Power of Systolic Computations.
Theor. Comput. Sci., 1990

Simulation of Systolic Tree Automata on Trellis Automata.
Int. J. Found. Comput. Sci., 1990

1988
Systolic Architectures, Systems and Computations.
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1986
Systolic Trellis Automata: Stability, Decidability and Complexity
Information and Control, December, 1986

Pragmatic Aspects of Complexity Theory (Panel).
IFIP Congress, 1986

1984
Systolic Automata - Power, Characterizations, Nonhomogeneity.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1983
On a Family of L Languages Resulting from Systolic Tree Automata.
Theor. Comput. Sci., 1983

1982
Systolic Automata for VLSI on Balanced Trees.
Acta Inf., 1982

1976
Descriptional Complexity (of Languages) - A Short Survey.
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1975
A note on ε-rules in context-free grammars.
Kybernetika, 1975

1973
Correction to: "On star height hierarchies of context-free languages".
Kybernetika, 1973

On star height hierarchies of context-free languages.
Kybernetika, 1973

Generalized context-free grammars.
Acta Cybern., 1973

Descriptional Complexity of Context-Free Languages.
Proceedings of the Mathematical Foundations of Computer Science: Proceedings of Symposium and Summer School, 1973

1972
On the size of context-free grammars.
Kybernetika, 1972

1971
A Few Remarks on the Index of Context-Free Grammars and Languages
Information and Control, October, 1971

Complexity and Unambiguity of Context-Free Grammars and Languages
Information and Control, June, 1971

A Characterization of Context-free Languages.
J. Comput. Syst. Sci., 1971

1969
Some Classifications of Context-Free Languages
Information and Control, February, 1969

1968
Unambiguity and ambiguity of context-free grammars and languages.
IFIP Congress (1), 1968

1967
On a classification of context-free languages.
Kybernetika, 1967

1966
On sets generated by context-free grammars.
Kybernetika, 1966


  Loading...