Janos Simon

Publication Activity (10 Years)

Years Active: 1974-2022
Publications (10 Years): 7

Top Topics

Customer Retention

Visual Landmarks

Top Venues

Publications

Janos Simon
Remembering Juris. SIGACT News 53 (4) (2022)
Zoltán Pap, Zlatko Covic, Janos Simon
Artificial intelligence voice assistant implementation possibilities in interactive toy for preschool age children. SISY (2021)
Imre Petkovics, Janos Simon, Ármin Petkovics, Zlatko Covic
Selection of unmanned aerial vehicle for precision agriculture with multi-criteria decision making algorithm. SISY (2017)
Zlatko Covic, Urmos Viktor, Janos Simon, Dalibor Dobrilovic, Zeljko Stojanov
Usage of QR codes in web based system for the electronic market research. SISY (2016)
Dalibor Dobrilovic, Zeljko Stojanov, Zlatko Covic, Janos Simon, Nikola Petrov
Model of data center temperature monitoring system with the use of open source hardware. SISY (2016)
Imre Petkovics, Ármin Petkovics, Janos Simon
A survey of ICT: Evolution of architectures, models and layers. SISY (2016)
Livia Szedmina, Piroska Stanic Molcer, Janos Simon, Zlatko Covic
Clicking for business English success. SISY (2015)
Janos Simon
Comparison of different mobile WSN node localization techniques within the controlled microclimatic environment. SISY (2014)
Stuart A. Kurtz, Janos Simon
The Undecidability of the Generalized Collatz Problem. TAMC (2007)
Giovanni Resta, Paolo Santi, Janos Simon
Analysis of multi-hop emergency message propagation in vehicular ad hoc networks. MobiHoc (2007)
André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon
Bounding the firing synchronization problem on a ring. Theor. Comput. Sci. 320 (2-3) (2004)
Paolo Santi, Janos Simon
Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks. EWSN (2004)
André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon
New Bounds for the Firing Squad Problem on a Ring. SIROCCO (2002)
Amber Settle, Janos Simon
Smaller solutions for the firing squad. Theor. Comput. Sci. 276 (1-2) (2002)
Luciano Margara, Janos Simon
Decidable Properties of Graphs of All-Optical Networks. ICALP (2001)
Janos Simon, Shi-Chun Tsai
On the bottleneck counting argument. Theor. Comput. Sci. 237 (1-2) (2000)
Luciano Margara, Janos Simon
Fibres per Link. ICALP (2000)
Amber Settle, Janos Simon
Improved bounds for the firing synchronization problem. SIROCCO (1998)
Janos Simon, Shi-Chun Tsai
A Note on the Bottleneck Counting Argument. Computational Complexity Conference (1997)
Bruno Codenotti, Peter Gemmell, Petr Pudlák, Janos Simon
On the Amount of Randomness Needed in Distributed Computations. OPODIS (1997)
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon
Active transport in biological computing. DNA Based Computers (1996)
Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon
Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS (1996)
Bruno Codenotti, Peter Gemmell, Janos Simon
Average Circuit Depth and Average Communication Complexity. ESA (1995)
Gene Itkis, Chengdian Lin, Janos Simon
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings. WDAG (1995)
Janos Simon, Mario Szegedy
On the Complexity of RAM with Various Operation Sets STOC (1992)
Chengdian Lin, Janos Simon
Observing Self-Stabilization. PODC (1992)
Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe
Milking the Aanderaa Argument Inf. Comput. 88 (1) (1990)
Janos Simon, Mario Szegedy
A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications. Advances In Computational Complexity Theory (1990)
Yukon Chang, Susanne E. Hambrusch, Janos Simon
On the Computational Complexity of Continuous Routing. J. Algorithms 10 (1) (1989)
Howard J. Karloff, Ramamohan Paturi, Janos Simon
Universal Traversal Sequences of Length n^O(log n) for Cliques. Inf. Process. Lett. 28 (5) (1988)
Piotr Berman, Janos Simon
Investigations of Fault-Tolerant Networks of Computers (Preliminary Version) STOC (1988)
Ramamohan Paturi, Janos Simon
Probabilistic Communication Complexity. J. Comput. Syst. Sci. 33 (1) (1986)
Larry G. Jones, Janos Simon
Hierarchical VLSI Design Systems Based on Attribute Grammars. POPL (1986)
Yukon Chang, Janos Simon
Continous Routing and Batch Routing on the Hypercube. PODC (1986)
László Babai, Peter Frankl, Janos Simon
Complexity classes in communication complexity theory (preliminary version) FOCS (1986)
Susanne E. Hambrusch, Janos Simon
Solving Undirected Graph Problems on VLSI. SIAM J. Comput. 14 (3) (1985)
Ramamohan Paturi, Janos Simon
Probabilistic Communication Complexity (Preliminary Version) FOCS (1984)
Joseph F. JáJá, Viktor K. Prasanna, Janos Simon
Information Transfer under Different Sets of Protocols. SIAM J. Comput. 13 (4) (1984)
Walter L. Ruzzo, Janos Simon, Martin Tompa
Space-Bounded Hierarchies and Probabilistic Computations. J. Comput. Syst. Sci. 28 (2) (1984)
Piotr Berman, Janos Simon
Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) FOCS (1983)
Susanne E. Hambrusch, Janos Simon
Lower Bounds for Solving Undirected Graph Problems on VLSI. ICALP (1983)
Ramamohan Paturi, Janos Simon
Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) FOCS (1983)
Walter L. Ruzzo, Janos Simon, Martin Tompa
Space-Bounded Hierarchies and Probabilistic Computations STOC (1982)
Joseph F. JáJá, Janos Simon
Space Efficient Algorithms for Some Graph Theoretical Problems. Acta Informatica 17 (1982)
Joseph F. JáJá, Janos Simon
Parallel Algorithms in Graph Theory: Planarity Testing. SIAM J. Comput. 11 (2) (1982)
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) (1981)
Janos Simon
Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version) STOC (1981)
Janos Simon
Division in Idealized Unit Cost RAMS. J. Comput. Syst. Sci. 22 (3) (1981)
Janos Simon
On Tape-Bounded Probabilistic Turing Machine Acceptors. Theor. Comput. Sci. 16 (1981)
John Gill, James Hunt, Janos Simon
Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers. Theor. Comput. Sci. 12 (1980)
Joseph F. JáJá, Janos Simon
Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). MFCS (1980)
Wolfgang J. Paul, Joel I. Seiferas, Janos Simon
An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version) STOC (1980)
Janos Simon
Division Is Good FOCS (1979)
Janos Simon, John Gill, James Hunt
On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract) FOCS (1978)
Janos Simon
On the Difference Between One and Many (Preliminary Version). ICALP (1977)
Janos Simon
On Feasible Numbers (Preliminary Version) STOC (1977)
Janos Simon
A comment on do traces. ACM SIGPLAN Notices 11 (10) (1976)
Juris Hartmanis, Janos Simon
On the Structure of Feasible Computations. Adv. Comput. 14 (1976)
Zvi Galil, Janos Simon
A Note on Multiple-Entry Finite Automata. J. Comput. Syst. Sci. 12 (3) (1976)
Juris Hartmanis, Janos Simon
On the Power of Multiplication in Random Access Machines SWAT (1974)
Juris Hartmanis, Janos Simon
On the Structure of Feasible Computation. GI Jahrestagung (1974)