The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Janos Simon: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Janos Simon, Shi-Chun Tsai
    A Note on the Bottleneck Counting Argument. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:297-301 [Conf]
  2. Bruno Codenotti, Peter Gemmell, Janos Simon
    Average Circuit Depth and Average Communication Complexity. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:102-112 [Conf]
  3. Paolo Santi, Janos Simon
    Silence Is Golden with High Probability: Maintaining a Connected Backbone in Wireless Sensor Networks. [Citation Graph (0, 0)][DBLP]
    EWSN, 2004, pp:106-121 [Conf]
  4. László Babai, Peter Frankl, Janos Simon
    Complexity classes in communication complexity theory (preliminary version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:337-347 [Conf]
  5. Piotr Berman, Janos Simon
    Lower Bounds on Graph Threading by Probabilistic Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:304-311 [Conf]
  6. Juris Hartmanis, Janos Simon
    On the Power of Multiplication in Random Access Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1974, pp:13-23 [Conf]
  7. Ramamohan Paturi, Janos Simon
    Lower Bounds on the Time of Probabilistic On-Line Simulations (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:343-350 [Conf]
  8. Ramamohan Paturi, Janos Simon
    Probabilistic Communication Complexity (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1984, pp:118-126 [Conf]
  9. Janos Simon
    Division Is Good [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:411-420 [Conf]
  10. Janos Simon, John Gill, James Hunt
    On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:107-112 [Conf]
  11. Juris Hartmanis, Janos Simon
    On the Structure of Feasible Computation. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1974, pp:3-51 [Conf]
  12. Susanne E. Hambrusch, Janos Simon
    Lower Bounds for Solving Undirected Graph Problems on VLSI. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:292-303 [Conf]
  13. Luciano Margara, Janos Simon
    Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:768-779 [Conf]
  14. Luciano Margara, Janos Simon
    Decidable Properties of Graphs of All-Optical Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:518-529 [Conf]
  15. Janos Simon
    On the Difference Between One and Many (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:480-491 [Conf]
  16. Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon
    Symmetry Breaking in Anonymous Networks: Characterizations. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:16-26 [Conf]
  17. Joseph JáJá, Janos Simon
    Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:305-319 [Conf]
  18. Bruno Codenotti, Peter Gemmell, Petr Pudlak, Janos Simon
    On the Amount of Randomness Needed in Distributed Computations. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1997, pp:237-248 [Conf]
  19. Yukon Chang, Janos Simon
    Continous Routing and Batch Routing on the Hypercube. [Citation Graph (0, 0)][DBLP]
    PODC, 1986, pp:272-281 [Conf]
  20. Chengdian Lin, Janos Simon
    Observing Self-Stabilization. [Citation Graph (0, 0)][DBLP]
    PODC, 1992, pp:113-123 [Conf]
  21. Larry G. Jones, Janos Simon
    Hierarchical VLSI Design Systems Based on Attribute Grammars. [Citation Graph (0, 0)][DBLP]
    POPL, 1986, pp:58-69 [Conf]
  22. André Berthiaume, Ljubomir Perkovic, Amber Settle, Janos Simon
    New Bounds for the Firing Squad Problem on a Ring. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:17-31 [Conf]
  23. Amber Settle, Janos Simon
    Improved bounds for the firing synchronization problem. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:66-81 [Conf]
  24. Piotr Berman, Janos Simon
    Investigations of Fault-Tolerant Networks of Computers (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:66-77 [Conf]
  25. Wolfgang J. Paul, Joel I. Seiferas, Janos Simon
    An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:357-367 [Conf]
  26. Walter L. Ruzzo, Janos Simon, Martin Tompa
    Space-Bounded Hierarchies and Probabilistic Computations [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:215-223 [Conf]
  27. Janos Simon
    On Feasible Numbers (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:195-207 [Conf]
  28. Janos Simon
    Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:158-167 [Conf]
  29. Janos Simon, Mario Szegedy
    On the Complexity of RAM with Various Operation Sets [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:624-631 [Conf]
  30. Gene Itkis, Chengdian Lin, Janos Simon
    Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings. [Citation Graph (0, 0)][DBLP]
    WDAG, 1995, pp:288-302 [Conf]
  31. Juris Hartmanis, Janos Simon
    On the Structure of Feasible Computations. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 1976, v:14, n:, pp:1-43 [Journal]
  32. Joseph JáJá, Janos Simon
    Space Efficient Algorithms for Some Graph Theoretical Problems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:17, n:, pp:411-423 [Journal]
  33. Ramamohan Paturi, Joel I. Seiferas, Janos Simon, Richard E. Newman-Wolfe
    Milking the Aanderaa Argument [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:88, n:1, pp:88-104 [Journal]
  34. Howard J. Karloff, Ramamohan Paturi, Janos Simon
    Universal Traversal Sequences of Length n^O(log n) for Cliques. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:5, pp:241-243 [Journal]
  35. Yukon Chang, Susanne E. Hambrusch, Janos Simon
    On the Computational Complexity of Continuous Routing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:1, pp:86-108 [Journal]
  36. Zvi Galil, Janos Simon
    A Note on Multiple-Entry Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:12, n:3, pp:350-351 [Journal]
  37. Ramamohan Paturi, Janos Simon
    Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:1, pp:106-123 [Journal]
  38. Wolfgang J. Paul, Joel I. Seiferas, Janos Simon
    An Information-Theoretic Approach to Time Bounds for On-Line Computation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:23, n:2, pp:108-126 [Journal]
  39. Walter L. Ruzzo, Janos Simon, Martin Tompa
    Space-Bounded Hierarchies and Probabilistic Computations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:2, pp:216-230 [Journal]
  40. Janos Simon
    Division in Idealized Unit Cost RAMS. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:22, n:3, pp:421-441 [Journal]
  41. Susanne E. Hambrusch, Janos Simon
    Solving Undirected Graph Problems on VLSI. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:3, pp:527-544 [Journal]
  42. Joseph JáJá, Viktor K. Prasanna, Janos Simon
    Information Transfer under Different Sets of Protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:4, pp:840-849 [Journal]
  43. Joseph JáJá, Janos Simon
    Parallel Algorithms in Graph Theory: Planarity Testing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:314-328 [Journal]
  44. André Berthiaume, Todd Bittner, Ljubomir Perkovic, Amber Settle, Janos Simon
    Bounding the firing synchronization problem on a ring. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:320, n:2-3, pp:213-228 [Journal]
  45. John Gill, James Hunt, Janos Simon
    Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:333-338 [Journal]
  46. Amber Settle, Janos Simon
    Smaller solutions for the firing squad. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:83-109 [Journal]
  47. Janos Simon
    On Tape-Bounded Probabilistic Turing Machine Acceptors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:75-91 [Journal]
  48. Janos Simon, Shi-Chun Tsai
    On the bottleneck counting argument. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:429-437 [Journal]
  49. Stuart A. Kurtz, Janos Simon
    The Undecidability of the Generalized Collatz Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:542-553 [Conf]

  50. Analysis of multi-hop emergency message propagation in vehicular ad hoc networks. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.016secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002