On the Power of Multiplication in Random Access Machines - Juris Hartmanis; Janos Simon (SWAT, 1974)

On the Structure of Feasible Computation. - Juris Hartmanis; Janos Simon (GI Jahrestagung, 1974)

On some central problems in computational complexity. - Janos Simon (1975)

On the Structure of Feasible Computations. - Juris Hartmanis; Janos Simon (Adv. Comput., 1976)

A Note on Multiple-Entry Finite Automata. - Zvi Galil; Janos Simon (J. Comput. Syst. Sci., 1976)

A comment on do traces. - Janos Simon (ACM SIGPLAN Notices, 1976)

On the Difference Between One and Many (Preliminary Version). - Janos Simon (ICALP, 1977)

On Feasible Numbers (Preliminary Version) - Janos Simon (STOC, 1977)

On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract) - Janos Simon; John Gill; James Hunt (FOCS, 1978)

Division Is Good - Janos Simon (FOCS, 1979)

Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). - Joseph F. JáJá; Janos Simon (MFCS, 1980)

An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version) - Wolfgang J. Paul; Joel I. Seiferas; Janos Simon (STOC, 1980)

Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers. - John Gill; James Hunt; Janos Simon (Theor. Comput. Sci., 1980)

Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version) - Janos Simon (STOC, 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)

Division in Idealized Unit Cost RAMS. - Janos Simon (J. Comput. Syst. Sci., 1981)

On Tape-Bounded Probabilistic Turing Machine Acceptors. - Janos Simon (Theor. Comput. Sci., 1981)

Space Efficient Algorithms for Some Graph Theoretical Problems. - Joseph F. JáJá; Janos Simon (Acta Informatica, 1982)

Parallel Algorithms in Graph Theory: Planarity Testing. - Joseph F. JáJá; Janos Simon (SIAM J. Comput., 1982)

Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) - Piotr Berman; Janos Simon (FOCS, 1983)

Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) - Ramamohan Paturi; Janos Simon (FOCS, 1983)

Lower Bounds for Solving Undirected Graph Problems on VLSI. - Susanne E. Hambrusch; Janos Simon (ICALP, 1983)

Probabilistic Communication Complexity (Preliminary Version) - Ramamohan Paturi; Janos Simon (FOCS, 1984)

Space-Bounded Hierarchies and Probabilistic Computations. - Walter L. Ruzzo; Janos Simon; Martin Tompa (J. Comput. Syst. Sci., 1984)

Information Transfer under Different Sets of Protocols. - Joseph F. JáJá; Viktor K. Prasanna; Janos Simon (SIAM J. Comput., 1984)

Solving Undirected Graph Problems on VLSI. - Susanne E. Hambrusch; Janos Simon (SIAM J. Comput., 1985)

Complexity classes in communication complexity theory (preliminary version) - László Babai; Peter Frankl; Janos Simon (FOCS, 1986)

Continous Routing and Batch Routing on the Hypercube. - Yukon Chang; Janos Simon (PODC, 1986)

Hierarchical VLSI Design Systems Based on Attribute Grammars. - Larry G. Jones; Janos Simon (POPL, 1986)

Probabilistic Communication Complexity. - Ramamohan Paturi; Janos Simon (J. Comput. Syst. Sci., 1986)

Investigations of Fault-Tolerant Networks of Computers (Preliminary Version) - Piotr Berman; Janos Simon (STOC, 1988)

Universal Traversal Sequences of Length n^O(log n) for Cliques. - Howard J. Karloff; Ramamohan Paturi; Janos Simon (Inf. Process. Lett., 1988)

On the Computational Complexity of Continuous Routing. - Yukon Chang; Susanne E. Hambrusch; Janos Simon (J. Algorithms, 1989)

A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications. - Janos Simon; Mario Szegedy (Advances In Computational Complexity Theory, 1990)

Milking the Aanderaa Argument - Ramamohan Paturi; Joel I. Seiferas; Janos Simon; Richard E. Newman-Wolfe (Inf. Comput., 1990)

Observing Self-Stabilization. - Chengdian Lin; Janos Simon (PODC, 1992)

On the Complexity of RAM with Various Operation Sets - Janos Simon; Mario Szegedy (STOC, 1992)

Average Circuit Depth and Average Communication Complexity. - Bruno Codenotti; Peter Gemmell; Janos Simon (ESA, 1995)

Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings. - Gene Itkis; Chengdian Lin; Janos Simon (WDAG, 1995)

Active transport in biological computing. - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer; Janos Simon (DNA Based Computers, 1996)

Symmetry Breaking in Anonymous Networks: Characterizations. - Paolo Boldi; Shella Shammah; Sebastiano Vigna; Bruno Codenotti; Peter Gemmell; Janos Simon (ISTCS, 1996)

A Note on the Bottleneck Counting Argument. - Janos Simon; Shi-Chun Tsai (CCC, 1997)

On the Amount of Randomness Needed in Distributed Computations. - Bruno Codenotti; Peter Gemmell; Petr Pudlák; Janos Simon (OPODIS, 1997)

Improved bounds for the firing synchronization problem. - Amber Settle; Janos Simon (SIROCCO, 1998)

Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link. - Luciano Margara; Janos Simon (ICALP, 2000)

On the bottleneck counting argument. - Janos Simon; Shi-Chun Tsai (Theor. Comput. Sci., 2000)

Decidable Properties of Graphs of All-Optical Networks. - Luciano Margara; Janos Simon (ICALP, 2001)

New Bounds for the Firing Squad Problem on a Ring. - André Berthiaume; Ljubomir Perkovic; Amber Settle; Janos Simon (SIROCCO, 2002)

Smaller solutions for the firing squad. - Amber Settle; Janos Simon (Theor. Comput. Sci., 2002)

Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks. - Paolo Santi; Janos Simon (EWSN, 2004)

Bounding the firing synchronization problem on a ring. - André Berthiaume; Todd Bittner; Ljubomir Perkovic; Amber Settle; Janos Simon (Theor. Comput. Sci., 2004)

Analysis of multi-hop emergency message propagation in vehicular ad hoc networks. - Giovanni Resta; Paolo Santi; Janos Simon (MobiHoc, 2007)

The Undecidability of the Generalized Collatz Problem. - Stuart A. Kurtz; Janos Simon (TAMC, 2007)

Comparison of different mobile WSN node localization techniques within the controlled microclimatic environment. - Janos Simon (SISY, 2014)

Clicking for business English success. - Livia Szedmina; Piroska Stanic Molcer; Janos Simon; Zlatko Covic (SISY, 2015)

Usage of QR codes in web based system for the electronic market research. - Zlatko Covic; Urmos Viktor; Janos Simon; Dalibor Dobrilovic; Zeljko Stojanov (SISY, 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 (SISY, 2016)

A survey of ICT: Evolution of architectures, models and layers. - Imre Petkovics; Ármin Petkovics; Janos Simon (SISY, 2016)

Selection of unmanned aerial vehicle for precision agriculture with multi-criteria decision making algorithm. - Imre Petkovics; Janos Simon; Ármin Petkovics; Zlatko Covic (SISY, 2017)

Artificial intelligence voice assistant implementation possibilities in interactive toy for preschool age children. - Zoltán Pap; Zlatko Covic; Janos Simon (SISY, 2021)

Remembering Juris. - Janos Simon (SIGACT News, 2022)