Janos Simon

Giovanni Resta, Paolo Santi, Janos Simon: Analysis of multi-hop emergency message propagation in vehicular ad hoc networks. MobiHoc 2007: 140-149

Stuart A. Kurtz, Janos Simon: The Undecidability of the Generalized Collatz Problem. TAMC 2007: 542-553

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

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

Amber Settle, Janos Simon: Smaller solutions for the firing squad. Theor. Comput. Sci. 276(1-2): 83-109 (2002)

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

Luciano Margara, Janos Simon: Decidable Properties of Graphs of All-Optical Networks. ICALP 2001: 518-529

Janos Simon, Shi-Chun Tsai: On the bottleneck counting argument. Theor. Comput. Sci. 237(1-2): 429-437 (2000)

Luciano Margara, Janos Simon: Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link. ICALP 2000: 768-779

Amber Settle, Janos Simon: Improved bounds for the firing synchronization problem. SIROCCO 1998: 66-81

Janos Simon, Shi-Chun Tsai: A Note on the Bottleneck Counting Argument. IEEE Conference on Computational Complexity 1997: 297-301

Bruno Codenotti, Peter Gemmell, Petr Pudlak, Janos Simon: On the Amount of Randomness Needed in Distributed Computations. OPODIS 1997: 237-248

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

Bruno Codenotti, Peter Gemmell, Janos Simon: Average Circuit Depth and Average Communication Complexity. ESA 1995: 102-112

Gene Itkis, Chengdian Lin, Janos Simon: Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings. WDAG 1995: 288-302

Chengdian Lin, Janos Simon: Observing Self-Stabilization. PODC 1992: 113-123

Janos Simon, Mario Szegedy: On the Complexity of RAM with Various Operation Sets. STOC 1992: 624-631

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

Yukon Chang, Susanne E. Hambrusch, Janos Simon: On the Computational Complexity of Continuous Routing. J. Algorithms 10(1): 86-108 (1989)

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

Piotr Berman, Janos Simon: Investigations of Fault-Tolerant Networks of Computers (Preliminary Version). STOC 1988: 66-77

Janos Simon (Ed.): Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA. ACM 1988, isbn 0-89791-264-0

Ramamohan Paturi, Janos Simon: Probabilistic Communication Complexity. J. Comput. Syst. Sci. 33(1): 106-123 (1986)

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

Yukon Chang, Janos Simon: Continous Routing and Batch Routing on the Hypercube. PODC 1986: 272-281

Larry G. Jones, Janos Simon: Hierarchical VLSI Design Systems Based on Attribute Grammars. POPL 1986: 58-69

Susanne E. Hambrusch, Janos Simon: Solving Undirected Graph Problems on VLSI. SIAM J. Comput. 14(3): 527-544 (1985)

Walter L. Ruzzo, Janos Simon, Martin Tompa: Space-Bounded Hierarchies and Probabilistic Computations. J. Comput. Syst. Sci. 28(2): 216-230 (1984)

Joseph JáJá, Viktor K. Prasanna, Janos Simon: Information Transfer under Different Sets of Protocols. SIAM J. Comput. 13(4): 840-849 (1984)

Ramamohan Paturi, Janos Simon: Probabilistic Communication Complexity (Preliminary Version). FOCS 1984: 118-126

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

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

Susanne E. Hambrusch, Janos Simon: Lower Bounds for Solving Undirected Graph Problems on VLSI. ICALP 1983: 292-303

Joseph JáJá, Janos Simon: Space Efficient Algorithms for Some Graph Theoretical Problems. Acta Inf. 17: 411-423 (1982)

Joseph JáJá, Janos Simon: Parallel Algorithms in Graph Theory: Planarity Testing. SIAM J. Comput. 11(2): 314-328 (1982)

Walter L. Ruzzo, Janos Simon, Martin Tompa: Space-Bounded Hierarchies and Probabilistic Computations. STOC 1982: 215-223

Janos Simon: Division in Idealized Unit Cost RAMS. J. Comput. Syst. Sci. 22(3): 421-441 (1981)

Wolfgang J. Paul, Joel I. Seiferas, Janos Simon: An Information-Theoretic Approach to Time Bounds for On-Line Computation. J. Comput. Syst. Sci. 23(2): 108-126 (1981)

Janos Simon: On Tape-Bounded Probabilistic Turing Machine Acceptors. Theor. Comput. Sci. 16: 75-91 (1981)

Janos Simon: Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version). STOC 1981: 158-167

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

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

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

Janos Simon: Division Is Good. FOCS 1979: 411-420

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

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

Janos Simon: On Feasible Numbers (Preliminary Version). STOC 1977: 195-207

Juris Hartmanis, Janos Simon: On the Structure of Feasible Computations. Advances in Computers 14: 1-43 (1976)

Zvi Galil, Janos Simon: A Note on Multiple-Entry Finite Automata. J. Comput. Syst. Sci. 12(3): 350-351 (1976)

Juris Hartmanis, Janos Simon: On the Power of Multiplication in Random Access Machines. SWAT (FOCS) 1974: 13-23

Juris Hartmanis, Janos Simon: On the Structure of Feasible Computation. GI Jahrestagung 1974: 3-51