Janos Simon
Janos Simon
Professor of Computer Science, The University of Chicago
Verified email at
Cited by
Cited by
Complexity classes in communication complexity theory
L Babai, P Frankl, J Simon
27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 337-347, 1986
On some central problems in computational complexity.
J Simon
Cornell University, 1975
Space-bounded hierarchies and probabilistic computations
WL Ruzzo, J Simon, M Tompa
Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982
Probabilistic communication complexity
R Paturi, J Simon
Journal of Computer and System Sciences 33 (1), 106-123, 1986
Analysis of multi-hop emergency message propagation in vehicular ad hoc networks
G Resta, P Santi, J Simon
Proceedings of the 8th ACM international symposium on Mobile ad hoc …, 2007
On the difference between one and many: preliminary version
J Simon
International Colloquium on Automata, Languages, and Programming, 480-491, 1977
On the power of multiplication in random access machines
J Hartmanis, J Simon
15th Annual Symposium on Switching and Automata Theory (swat 1974), 13-23, 1974
Symmetry Breaking in Anonymous Networks: Characterizations.
P Boldi, S Shammah, S Vigna, B Codenotti, P Gemmell, J Simon
ISTCS, 16-26, 1996
Decision trees and random access machines
W Paul, J Simon
Logic and Algorithmic 30, 331-340, 1980
Silence is golden with high probability: Maintaining a connected backbone in wireless sensor networks
P Santi, J Simon
European Workshop on Wireless Sensor Networks, 106-121, 2004
Parallel algorithms in graph theory: Planarity testing
J Ja’Ja’, J Simon
SIAM Journal on Computing 11 (2), 314-328, 1982
An information-theoretic approach to time bounds for on-line computation (preliminary version)
WJ Paul, JI Seiferas, J Simon
Proceedings of the twelfth annual ACM symposium on Theory of computing, 357-367, 1980
Hierarchical VLSI design systems based on attribute grammars
LG Jones, J Simon
Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of …, 1986
Deterministic, constant space, self-stabilizing leader election on uniform rings
G Itkis, C Lin, J Simon
Distributed Algorithms: 9th International Workshop, WDAG'95 Le Mont-Saint …, 1995
A new lower bound theorem for read only once branching programs and its applications
J Simon, M Szegedy
Advances in Computational Complexity Theory, 183-193, 1993
Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link
L Margara, J Simon
International Colloquium on Automata, Languages, and Programming, 768-779, 2000
Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version)
J Simon
Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981
On the structure of feasible computations
J Hartmanis, J Simon
Advances in Computers 14, 1-43, 1976
Active transport in biological computing
SA Kurtz
Second Annual Meeting on DNA Based Computers, 111-121, 1996
Lower bounds on graph threading by probabilistic machines
P Berman, J Simon
24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 304-311, 1983
The system can't perform the operation now. Try again later.
Articles 1–20