Janos Simon - RankMe

63 papers A* 20A 2B 6C 1Misc 7Journal 20Unranked 6

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