Janos Simon

According to our database, Janos Simon authored at least 61 papers between 1974 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2022

Remembering Juris.

Janos Simon

SIGACT News, 2022

2021

Artificial intelligence voice assistant implementation possibilities in interactive toy for preschool age children.

Zoltán Pap, Zlatko Covic, Janos Simon

Proceedings of the 19th IEEE International Symposium on Intelligent Systems and Informatics, 2021

2017

Selection of unmanned aerial vehicle for precision agriculture with multi-criteria decision making algorithm.

Imre Petkovics, Janos Simon, Ármin Petkovics, Zlatko Covic

Proceedings of the 15th IEEE International Symposium on Intelligent Systems and Informatics, 2017

2016

A survey of ICT: Evolution of architectures, models and layers.

Imre Petkovics, Ármin Petkovics, Janos Simon

Proceedings of the 14th IEEE International Symposium on Intelligent Systems and Informatics, 2016

Model of data center temperature monitoring system with the use of open source hardware.

Dalibor Dobrilovic, Zeljko Stojanov, Zlatko Covic, Janos Simon, Nikola Petrov

Proceedings of the 14th IEEE International Symposium on Intelligent Systems and Informatics, 2016

Usage of QR codes in web based system for the electronic market research.

Zlatko Covic, Urmos Viktor, Janos Simon, Dalibor Dobrilovic, Zeljko Stojanov

Proceedings of the 14th IEEE International Symposium on Intelligent Systems and Informatics, 2016

2015

Clicking for business English success.

Livia Szedmina, Piroska Stanic Molcer, Janos Simon, Zlatko Covic

Proceedings of the 13th IEEE International Symposium on Intelligent Systems and Informatics, 2015

2014

Comparison of different mobile WSN node localization techniques within the controlled microclimatic environment.

Janos Simon

Proceedings of the IEEE 12th International Symposium on Intelligent Systems and Informatics, 2014

2007

The Undecidability of the Generalized Collatz Problem.

Stuart A. Kurtz, Janos Simon

Proceedings of the Theory and Applications of Models of Computation, 2007

Analysis of multi-hop emergency message propagation in vehicular ad hoc networks.

Giovanni Resta, Paolo Santi, Janos Simon

Proceedings of the 8th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, 2007

2004

Bounding the firing synchronization problem on a ring.

André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon

Theor. Comput. Sci., 2004

Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks.

Paolo Santi, Janos Simon

Proceedings of the Wireless Sensor Networks, First European Workshop, 2004

2002

Smaller solutions for the firing squad.

Amber Settle, Janos Simon

Theor. Comput. Sci., 2002

New Bounds for the Firing Squad Problem on a Ring.

André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon

Proceedings of the SIROCCO 9, 2002

2001

Decidable Properties of Graphs of All-Optical Networks.

Luciano Margara, Janos Simon

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

2000

On the bottleneck counting argument.

Janos Simon, Shi-Chun Tsai

Theor. Comput. Sci., 2000

Wavelength Assignment Problem on All-Optical Networks with <i>k</i> Fibres per Link.

Luciano Margara, Janos Simon

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1998

Improved bounds for the firing synchronization problem.

Amber Settle, Janos Simon

Proceedings of the SIROCCO'98, 1998

1997

On the Amount of Randomness Needed in Distributed Computations.

Bruno Codenotti, Peter Gemmell, Petr Pudlák, Janos Simon

Proceedings of the On Principles Of Distributed Systems, 1997

A Note on the Bottleneck Counting Argument.

Janos Simon, Shi-Chun Tsai

Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996

Symmetry Breaking in Anonymous Networks: Characterizations.

Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon

Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

Active transport in biological computing.

Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon

Proceedings of the DNA Based Computers, 1996

1995

Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings.

Gene Itkis, Chengdian Lin, Janos Simon

Proceedings of the Distributed Algorithms, 9th International Workshop, 1995

Average Circuit Depth and Average Communication Complexity.

Bruno Codenotti, Peter Gemmell, Janos Simon

Proceedings of the Algorithms, 1995

1992

On the Complexity of RAM with Various Operation Sets

Janos Simon, Mario Szegedy

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Observing Self-Stabilization.

Chengdian Lin, Janos Simon

Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1990

Milking the Aanderaa Argument

Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe

Inf. Comput., September, 1990

A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications.

Janos Simon, Mario Szegedy

Proceedings of the Advances In Computational Complexity Theory, 1990

1989

On the Computational Complexity of Continuous Routing.

Yukon Chang, Susanne E. Hambrusch, Janos Simon

J. Algorithms, 1989

1988

Universal Traversal Sequences of Length n^O(log n) for Cliques.

Howard J. Karloff, Ramamohan Paturi, Janos Simon

Inf. Process. Lett., 1988

Investigations of Fault-Tolerant Networks of Computers (Preliminary Version)

Piotr Berman, Janos Simon

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1986

Probabilistic Communication Complexity.

Ramamohan Paturi, Janos Simon

J. Comput. Syst. Sci., 1986

Hierarchical VLSI Design Systems Based on Attribute Grammars.

Larry G. Jones, Janos Simon

Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

Continous Routing and Batch Routing on the Hypercube.

Yukon Chang, Janos Simon

Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

Complexity classes in communication complexity theory (preliminary version)

László Babai, Peter Frankl, Janos Simon

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985

Solving Undirected Graph Problems on VLSI.

Susanne E. Hambrusch, Janos Simon

SIAM J. Comput., 1985

1984

Information Transfer under Different Sets of Protocols.

Joseph F. JáJá, Viktor K. Prasanna, Janos Simon

SIAM J. Comput., 1984

Space-Bounded Hierarchies and Probabilistic Computations.

Walter L. Ruzzo, Janos Simon, Martin Tompa

J. Comput. Syst. Sci., 1984

Probabilistic Communication Complexity (Preliminary Version)

Ramamohan Paturi, Janos Simon

Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

1983

Lower Bounds for Solving Undirected Graph Problems on VLSI.

Susanne E. Hambrusch, Janos Simon

Proceedings of the Automata, 1983

Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version)

Ramamohan Paturi, Janos Simon

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version)

Piotr Berman, Janos Simon

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

Parallel Algorithms in Graph Theory: Planarity Testing.

Joseph F. JáJá, Janos Simon

SIAM J. Comput., 1982

Space Efficient Algorithms for Some Graph Theoretical Problems.

Joseph F. JáJá, Janos Simon

Acta Informatica, 1982

1981

On Tape-Bounded Probabilistic Turing Machine Acceptors.

Janos Simon

Theor. Comput. Sci., 1981

Division in Idealized Unit Cost RAMS.

Janos Simon

J. Comput. Syst. Sci., 1981

An Information-Theoretic Approach to Time Bounds for On-Line Computation.

Wolfgang J. Paul, Joel I. Seiferas, Janos Simon

J. Comput. Syst. Sci., 1981

Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version)

Janos Simon

Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

1980

Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers.

John Gill, James Hunt, Janos Simon

Theor. Comput. Sci., 1980

An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version)

Wolfgang J. Paul, Joel I. Seiferas, Janos Simon

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version).

Joseph F. JáJá, Janos Simon

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979

Division Is Good

Janos Simon

Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

1978

On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract)

Janos Simon, John Gill, James Hunt

Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977

On Feasible Numbers (Preliminary Version)

Janos Simon

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

On the Difference Between One and Many (Preliminary Version).

Janos Simon

Proceedings of the Automata, 1977

1976

A comment on do traces.

Janos Simon

ACM SIGPLAN Notices, 1976

A Note on Multiple-Entry Finite Automata.

Zvi Galil, Janos Simon

J. Comput. Syst. Sci., 1976

On the Structure of Feasible Computations.

Juris Hartmanis, Janos Simon

Adv. Comput., 1976

1975

On some central problems in computational complexity.

Janos Simon

PhD thesis, 1975

1974

On the Structure of Feasible Computation.

Juris Hartmanis, Janos Simon

Proceedings of the GI - 4. Jahrestagung, Berlin, 9.-12. Oktober 1974, 1974

On the Power of Multiplication in Random Access Machines

Juris Hartmanis, Janos Simon

Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974