default search action
Janos Simon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j20]Janos Simon:
Remembering Juris. SIGACT News 53(4): 41-47 (2022) - 2021
- [c41]Zoltán Pap
, Zlatko Covic, Janos Simon:
Artificial intelligence voice assistant implementation possibilities in interactive toy for preschool age children. SISY 2021: 21-26
2010 – 2019
- 2017
- [c40]Imre Petkovics, Janos Simon
Selection of unmanned aerial vehicle for precision agriculture with multi-criteria decision making algorithm. SISY 2017: 151-156 - 2016
- [c39]Zlatko Covic, Urmos Viktor, Janos Simon
Usage of QR codes in web based system for the electronic market research. SISY 2016: 187-192 - [c38]Imre Petkovics, Ármin Petkovics, Janos Simon
A survey of ICT: Evolution of architectures, models and layers. SISY 2016: 215-220 - [c37]Dalibor Dobrilovic
Model of data center temperature monitoring system with the use of open source hardware. SISY 2016: 221-226 - 2015
- [c36]Livia Szedmina, Piroska Stanic Molcer
Clicking for business English success. SISY 2015: 313-317 - 2014
- [c35]Janos Simon
Comparison of different mobile WSN node localization techniques within the controlled microclimatic environment. SISY 2014: 79-82
2000 – 2009
- 2007
- [c34]Giovanni Resta
Analysis of multi-hop emergency message propagation in vehicular ad hoc networks. MobiHoc 2007: 140-149 - [c33]Stuart A. Kurtz, Janos Simon:
The Undecidability of the Generalized Collatz Problem. TAMC 2007: 542-553 - 2004
- [j19]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) - [c32]Paolo Santi, Janos Simon:
Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks. EWSN 2004: 106-121 - 2002
- [j18]Amber Settle, Janos Simon:
Smaller solutions for the firing squad. Theor. Comput. Sci. 276(1-2): 83-109 (2002) - [c31]André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon:
New Bounds for the Firing Squad Problem on a Ring. SIROCCO 2002: 17-31 - 2001
- [c30]Luciano Margara
Decidable Properties of Graphs of All-Optical Networks. ICALP 2001: 518-529 - 2000
- [j17]Janos Simon, Shi-Chun Tsai:
On the bottleneck counting argument. Theor. Comput. Sci. 237(1-2): 429-437 (2000) - [c29]Luciano Margara
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link. ICALP 2000: 768-779
1990 – 1999
- 1998
- [c28]Amber Settle, Janos Simon:
Improved bounds for the firing synchronization problem. SIROCCO 1998: 66-81 - 1997
- [c27]Janos Simon, Shi-Chun Tsai:
A Note on the Bottleneck Counting Argument. CCC 1997: 297-301 - [c26]Bruno Codenotti, Peter Gemmell, Petr Pudlák, Janos Simon:
On the Amount of Randomness Needed in Distributed Computations. OPODIS 1997: 237-248 - 1996
- [c25]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon:
Active transport in biological computing. DNA Based Computers 1996: 171-179 - [c24]Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon:
Symmetry Breaking in Anonymous Networks: Characterizations. ISTCS 1996: 16-26 - 1995
- [c23]Bruno Codenotti, Peter Gemmell, Janos Simon:
Average Circuit Depth and Average Communication Complexity. ESA 1995: 102-112 - [c22]Gene Itkis, Chengdian Lin, Janos Simon:
Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings. WDAG 1995: 288-302 - 1992
- [c21]Chengdian Lin, Janos Simon:
Observing Self-Stabilization. PODC 1992: 113-123 - [c20]Janos Simon, Mario Szegedy:
On the Complexity of RAM with Various Operation Sets. STOC 1992: 624-631 - 1990
- [j16]Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe:
Milking the Aanderaa Argument. Inf. Comput. 88(1): 88-104 (1990) - [c19]Janos Simon, Mario Szegedy:
A New Lower Bound Theorem for Read-Only-Once Branching Programs and its Applications. Advances In Computational Complexity Theory 1990: 183-193
1980 – 1989
- 1989
- [j15]Yukon Chang, Susanne E. Hambrusch, Janos Simon:
On the Computational Complexity of Continuous Routing. J. Algorithms 10(1): 86-108 (1989) - 1988
- [j14]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) - [c18]Piotr Berman, Janos Simon:
Investigations of Fault-Tolerant Networks of Computers (Preliminary Version). STOC 1988: 66-77 - [e1]Janos Simon:
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 [contents] - 1986
- [j13]Ramamohan Paturi, Janos Simon:
Probabilistic Communication Complexity. J. Comput. Syst. Sci. 33(1): 106-123 (1986) - [c17]László Babai
Complexity classes in communication complexity theory (preliminary version). FOCS 1986: 337-347 - [c16]Yukon Chang, Janos Simon:
Continous Routing and Batch Routing on the Hypercube. PODC 1986: 272-281 - [c15]Larry G. Jones, Janos Simon:
Hierarchical VLSI Design Systems Based on Attribute Grammars. POPL 1986: 58-69 - 1985
- [j12]Susanne E. Hambrusch, Janos Simon:
Solving Undirected Graph Problems on VLSI. SIAM J. Comput. 14(3): 527-544 (1985) - 1984
- [j11]Walter L. Ruzzo
Space-Bounded Hierarchies and Probabilistic Computations. J. Comput. Syst. Sci. 28(2): 216-230 (1984) - [j10]Joseph F. JáJá, Viktor K. Prasanna, Janos Simon:
Information Transfer under Different Sets of Protocols. SIAM J. Comput. 13(4): 840-849 (1984) - [c14]Ramamohan Paturi, Janos Simon:
Probabilistic Communication Complexity (Preliminary Version). FOCS 1984: 118-126 - 1983
- [c13]Piotr Berman, Janos Simon:
Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version). FOCS 1983: 304-311 - [c12]Ramamohan Paturi, Janos Simon:
Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version). FOCS 1983: 343-350 - [c11]Susanne E. Hambrusch, Janos Simon:
Lower Bounds for Solving Undirected Graph Problems on VLSI. ICALP 1983: 292-303 - 1982
- [j9]Joseph F. JáJá, Janos Simon:
Space Efficient Algorithms for Some Graph Theoretical Problems. Acta Informatica 17: 411-423 (1982) - [j8]Joseph F. JáJá, Janos Simon:
Parallel Algorithms in Graph Theory: Planarity Testing. SIAM J. Comput. 11(2): 314-328 (1982) - [c10]Walter L. Ruzzo
Space-Bounded Hierarchies and Probabilistic Computations. STOC 1982: 215-223 - 1981
- [j7]Janos Simon:
Division in Idealized Unit Cost RAMS. J. Comput. Syst. Sci. 22(3): 421-441 (1981) - [j6]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) - [j5]Janos Simon:
On Tape-Bounded Probabilistic Turing Machine Acceptors. Theor. Comput. Sci. 16: 75-91 (1981) - [c9]Janos Simon:
Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version). STOC 1981: 158-167 - 1980
- [j4]John Gill, James Hunt, Janos Simon:
Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers. Theor. Comput. Sci. 12: 333-338 (1980) - [c8]Joseph F. JáJá, Janos Simon:
Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). MFCS 1980: 305-319 - [c7]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
1970 – 1979
- 1979
- [c6]Janos Simon:
Division Is Good. FOCS 1979: 411-420 - 1978
- [c5]Janos Simon, John Gill, James Hunt:
On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract). FOCS 1978: 107-112 - 1977
- [c4]Janos Simon:
On the Difference Between One and Many (Preliminary Version). ICALP 1977: 480-491 - [c3]Janos Simon:
On Feasible Numbers (Preliminary Version). STOC 1977: 195-207 - 1976
- [j3]Juris Hartmanis, Janos Simon:
On the Structure of Feasible Computations. Adv. Comput. 14: 1-43 (1976) - [j2]Zvi Galil, Janos Simon:
A Note on Multiple-Entry Finite Automata. J. Comput. Syst. Sci. 12(3): 350-351 (1976) - [j1]Janos Simon:
A comment on do traces. ACM SIGPLAN Notices 11(10): 49-52 (1976) - 1975
- [b1]Janos Simon:
On some central problems in computational complexity. Cornell University, USA, 1975 - 1974
- [c2]Juris Hartmanis, Janos Simon:
On the Power of Multiplication in Random Access Machines. SWAT 1974: 13-23 - [c1]Juris Hartmanis, Janos Simon:
On the Structure of Feasible Computation. GI Jahrestagung 1974: 3-51
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: