Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarJanos Simon
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2016
[c39]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: 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, Zeljko Stojanov, Zlatko Covic, Janos Simon, Nikola Petrov:
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, Janos Simon, Zlatko Covic:
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, Paolo Santi, Janos Simon:
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
- [j18]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
- [j17]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, Janos Simon:
Decidable Properties of Graphs of All-Optical Networks. ICALP 2001: 518-529 - 2000
- [j16]Janos Simon, Shi-Chun Tsai:
On the bottleneck counting argument. Theor. Comput. Sci. 237(1-2): 429-437 (2000) - [c29]Luciano Margara, Janos Simon:
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. IEEE Conference on Computational Complexity 1997: 297-301 - [c26]Bruno Codenotti, Peter Gemmell, Petr Pudlak, 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-180 - [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]
- [c20]Janos Simon, Mario Szegedy:
On the Complexity of RAM with Various Operation Sets. STOC 1992: 624-631 - 1990
- [j15]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-194
1980 – 1989
- 1989
- [j14]Yukon Chang, Susanne E. Hambrusch, Janos Simon:
On the Computational Complexity of Continuous Routing. J. Algorithms 10(1): 86-108 (1989) - 1988
- [j13]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
- [j12]Ramamohan Paturi, Janos Simon:
Probabilistic Communication Complexity. J. Comput. Syst. Sci. 33(1): 106-123 (1986) - [c17]László Babai, Peter Frankl, Janos Simon:
Complexity classes in communication complexity theory (preliminary version). FOCS 1986: 337-347 - [c16]
- [c15]Larry G. Jones, Janos Simon:
Hierarchical VLSI Design Systems Based on Attribute Grammars. POPL 1986: 58-69 - 1985
- [j11]Susanne E. Hambrusch, Janos Simon:
Solving Undirected Graph Problems on VLSI. SIAM J. Comput. 14(3): 527-544 (1985) - 1984
- [j10]Walter L. Ruzzo, Janos Simon, Martin Tompa:
Space-Bounded Hierarchies and Probabilistic Computations. J. Comput. Syst. Sci. 28(2): 216-230 (1984) - [j9]Joseph 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
- [j8]Joseph JáJá, Janos Simon:
Space Efficient Algorithms for Some Graph Theoretical Problems. Acta Inf. 17: 411-423 (1982) - [j7]Joseph JáJá, Janos Simon:
Parallel Algorithms in Graph Theory: Planarity Testing. SIAM J. Comput. 11(2): 314-328 (1982) - [c10]Walter L. Ruzzo, Janos Simon, Martin Tompa:
Space-Bounded Hierarchies and Probabilistic Computations. STOC 1982: 215-223 - 1981
- [j6]
- [j5]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) - [j4]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
- [j3]John Gill, James Hunt, Janos Simon:
Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers. Theor. Comput. Sci. 12: 333-338 (1980) - [c8]Joseph 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]
- 1978
- [c5]Janos Simon, John Gill, James Hunt:
On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract). FOCS 1978: 107-112 - 1977
- [c4]
- [c3]
- 1976
- [j2]Juris Hartmanis, Janos Simon:
On the Structure of Feasible Computations. Advances in Computers 14: 1-43 (1976) - [j1]Zvi Galil, Janos Simon:
A Note on Multiple-Entry Finite Automata. J. Comput. Syst. Sci. 12(3): 350-351 (1976) - 1974
- [c2]Juris Hartmanis, Janos Simon:
On the Power of Multiplication in Random Access Machines. SWAT (FOCS) 1974: 13-23 - [c1]
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-16 22:41 CEST by the dblp team