The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Shimon Even: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Baruch Awerbuch, Shimon Even
    Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. [Citation Graph (2, 0)][DBLP]
    PODC, 1984, pp:278-281 [Conf]
  2. Shimon Even, Alon Itai, Adi Shamir
    On the Complexity of Timetable and Multicommodity Flow Problems. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:4, pp:691-703 [Journal]
  3. Shimon Even
    Parallelism in Tape-Sorting. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1974, v:17, n:4, pp:202-204 [Journal]
  4. Shimon Even, Oded Goldreich, Abraham Lempel
    A Randomized Protocol for Signing Contracts. [Citation Graph (1, 0)][DBLP]
    Commun. ACM, 1985, v:28, n:6, pp:637-647 [Journal]
  5. Shimon Even
    An Algorithm for Determining Whether the Connectivity of a Graph is at Least k. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:3, pp:393-396 [Journal]
  6. Shimon Even, Yishay Mansour
    A Construction of a Cioher From a Single Pseudorandom Permutation. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1991, pp:210-224 [Conf]
  7. Guy Even, Shimon Even
    Embedding Interconnection Networks in Grids via the Layered Cross Product. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:3-12 [Conf]
  8. Shimon Even, Ami Litman
    A Unified Scheme for Routing in Expander Based Networks. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:125-135 [Conf]
  9. Shimon Even
    Protocol for Signing Contracts. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1981, pp:148-153 [Conf]
  10. Shimon Even
    Systolic Modular Multiplication. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:619-624 [Conf]
  11. Shimon Even, Oded Goldreich, Adi Shamir
    On the Security of Ping-Pong Protocols when Implemented using the RSA. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:58-72 [Conf]
  12. Shimon Even, Oded Goldreich, Silvio Micali
    On-Line/Off-Line Digital Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1989, pp:263-275 [Conf]
  13. Shimon Even, Oded Goldreich
    On the Security of Multi-Party Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:315- [Conf]
  14. Shimon Even, Oded Goldreich
    On the Power of Cascade Ciphers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:43-50 [Conf]
  15. Shimon Even, Oded Goldreich
    Electronic Wallet. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:383-386 [Conf]
  16. Danny Dolev, Shimon Even, Richard M. Karp
    On the Security of Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:177-186 [Conf]
  17. Shimon Even, Oded Goldreich, Abraham Lempel
    A Randomized Protocol for Signing Contracts. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1982, pp:205-210 [Conf]
  18. Shimon Even, Gene Itkis, Sergio Rajsbaum
    On Mixed Connectivity Certificates (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:1-16 [Conf]
  19. Shimon Even
    Generalized automata and their information losslessness [Citation Graph (0, 0)][DBLP]
    FOCS, 1962, pp:143-147 [Conf]
  20. Shimon Even, Oded Goldreich
    On the Security of Multi-Party Ping-Pong Protocols [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:34-39 [Conf]
  21. Shimon Even, Alon Itai, Adi Shamir
    On the Complexity of Timetable and Multi-Commodity Flow Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:184-193 [Conf]
  22. Shimon Even, Oded Kariv
    An O(n^2.5) Algorithm for Maximum Matching in General Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:100-112 [Conf]
  23. Shimon Even, I. Kohavi, Azaria Paz
    On Minimal Modulo 2 Sums of Products for Switching Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1966, pp:201-206 [Conf]
  24. Shimon Even, Ami Litman, Peter Winkler
    Computing with Snakes in Directed Networks of Automata (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:740-745 [Conf]
  25. Shimon Even, G. Granot
    Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:64-75 [Conf]
  26. Shimon Even, Yacov Yacobi
    Cryptocomplexity and NP-Completeness. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:195-207 [Conf]
  27. Shimon Even
    The Max Flow of Dinic and Karzanov: An Exposition. [Citation Graph (0, 0)][DBLP]
    Jerusalem Conference on Information Technology, 1978, pp:233-237 [Conf]
  28. Maria Artishchev-Zapolotsky, Shimon Even, Vladimir Yanovski
    Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2005, pp:124-130 [Conf]
  29. Shimon Even, Roni Kupershtok
    Layout area of the hypercube (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:366-371 [Conf]
  30. Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg
    A Tight Layout of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:170-175 [Conf]
  31. Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky
    Some Compact Layouts of the Butterfly. [Citation Graph (0, 0)][DBLP]
    SPAA, 1999, pp:54-63 [Conf]
  32. Shimon Even, Ami Litman
    On the Capabilities of Systolic Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1991, pp:357-367 [Conf]
  33. Shimon Even, Ami Litman
    Layered Cross Product - A Technique to Construct Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:60-69 [Conf]
  34. Shimon Even, Burkhard Monien
    On the Number of Rounds Necessary to Disseminate Information. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:318-327 [Conf]
  35. Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp
    Layout of the Batcher Bitonic Sorter (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1998, pp:172-181 [Conf]
  36. Reuven Bar-Yehuda, Shimon Even
    On Approximating a Vertex Cover for Planar Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1982, pp:303-309 [Conf]
  37. Shimon Even, Sergio Rajsbaum
    The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:95-105 [Conf]
  38. Shimon Even, Robert Endre Tarjan
    a Combinatorial Problem which is Complete in Polynomial Space [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:66-71 [Conf]
  39. Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar
    Traversing Directed Eulerian Mazes. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:35-46 [Conf]
  40. Shimon Even, Yacov Yacobi
    An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:270-278 [Conf]
  41. Shimon Even, Michael Rodeh
    Economical Encoding of Commas Between Strings. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1978, v:21, n:4, pp:315-317 [Journal]
  42. Danny Dolev, Shimon Even, Richard M. Karp
    On the Security of Ping-Pong Protocols [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:55, n:1-3, pp:57-68 [Journal]
  43. Shimon Even, Abraham Lempel
    Generation and Enumeration of All Solutions of the Characteristic Sum Condition [Citation Graph (0, 0)][DBLP]
    Information and Control, 1972, v:21, n:5, pp:476-482 [Journal]
  44. Shimon Even, Timothy J. Long, Yacov Yacobi
    A Note on Deterministic and Nondeterministic Time Complexity [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:55, n:1-3, pp:117-124 [Journal]
  45. Shimon Even, Alan L. Selman, Yacov Yacobi
    The Complexity of Promise Problems with Applications to Public-Key Cryptography [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:61, n:2, pp:159-173 [Journal]
  46. Shimon Even, Amir Pnueli, Abraham Lempel
    Permutation Graphs and Transitive Graphs. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:3, pp:400-410 [Journal]
  47. Shimon Even, Yossi Shiloach
    An On-Line Edge-Deletion Problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:1, pp:1-4 [Journal]
  48. Shimon Even, Alan L. Selman, Yacov Yacobi
    Hard-Core Theorems for Complexity Classes [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:1, pp:205-217 [Journal]
  49. Shimon Even, Robert Endre Tarjan
    A Combinatorial Problem Which Is Complete in Polynomial Space. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1976, v:23, n:4, pp:710-719 [Journal]
  50. Yehoshua Perl, M. R. Garey, Shimon Even
    Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:2, pp:202-214 [Journal]
  51. Michael Rodeh, Vaughan R. Pratt, Shimon Even
    Linear Algorithm for Data Compression via String Matching. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:1, pp:16-24 [Journal]
  52. Reuven Bar-Yehuda, Shimon Even
    A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:2, pp:198-203 [Journal]
  53. Shimon Even, Oded Goldreich
    The Minimum-Length Generator Sequence Problem is NP-Hard. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1981, v:2, n:3, pp:311-313 [Journal]
  54. Shimon Even, Ami Litman, Peter Winkler
    Computing with Snakes in Directed Networks of Automata. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:158-170 [Journal]
  55. F. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli
    Marked Directed Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1971, v:5, n:5, pp:511-523 [Journal]
  56. Gideon Ehrlich, Shimon Even, Robert Endre Tarjan
    Intersection graphs of curves in the plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:1, pp:8-20 [Journal]
  57. Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar
    Traversing Directed Eulerian Mazes. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2002, v:6, n:2, pp:157-173 [Journal]
  58. Shimon Even, Oded Goldreich, Silvio Micali
    On-Line/Off-Line Digital Signatures. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:1, pp:35-67 [Journal]
  59. Shimon Even, Yishay Mansour
    A Construction of a Cipher from a Single Pseudorandom Permutation. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1997, v:10, n:3, pp:151-162 [Journal]
  60. Yefim Dinitz, Shimon Even, Maria Zapolotsky
    A Compact Layout of the Butterfly. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2003, v:4, n:1, pp:53-75 [Journal]
  61. Shimon Even, Roni Kupershtok
    Layout Area of the Hypercube. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2003, v:4, n:4, pp:395-417 [Journal]
  62. Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg
    A Tight Layout of the Butterfly Network. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:4, pp:475-488 [Journal]
  63. Shimon Even, Roni Kupershtok
    Laying Out the Interconnection Network of the Transpose Bijection. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:5, pp:545-558 [Journal]
  64. Shimon Even, Ami Litman
    On the Capabilities of Systolic Systems. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:1, pp:3-28 [Journal]
  65. Shimon Even, Sergio Rajsbaum
    Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:5, pp:421-435 [Journal]
  66. Shimon Even, Sergio Rajsbaum
    The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:5, pp:447-474 [Journal]
  67. Shimon Even
    Area efficient layouts of the Batcher sorting networks. [Citation Graph (0, 0)][DBLP]
    Networks, 2001, v:38, n:4, pp:199-208 [Journal]
  68. Guy Even, Shimon Even
    Embedding interconnection networks in grids via the layered cross product. [Citation Graph (0, 0)][DBLP]
    Networks, 2000, v:36, n:2, pp:91-95 [Journal]
  69. Shimon Even, Ami Litman
    Layered cross product - A technique to construct interconnection networks. [Citation Graph (0, 0)][DBLP]
    Networks, 1997, v:29, n:4, pp:219-223 [Journal]
  70. Edward G. Coffman Jr., Shimon Even
    A Note on Limited Preemption. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:1, pp:3-6 [Journal]
  71. Shimon Even, Robert Endre Tarjan
    Network Flow and Testing Graph Connectivity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:4, pp:507-518 [Journal]
  72. Shimon Even, Ami Litman, Arnold L. Rosenberg
    Monochromatic Paths and Triangulated Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:4, pp:546-556 [Journal]
  73. Shimon Even, Gene Itkis, Sergio Rajsbaum
    On Mixed Connectivity Certificates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:203, n:2, pp:253-269 [Journal]
  74. Shimon Even, Robert Endre Tarjan
    Computing an st -Numbering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:2, n:3, pp:339-344 [Journal]
  75. Shimon Even, Robert Endre Tarjan
    Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:1, pp:123- [Journal]
  76. Shimon Even, Oded Goldreich
    DES-like functions can generate the alternating group. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:6, pp:863-865 [Journal]
  77. Shimon Even, Oded Goldreich
    Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:5, pp:780-0 [Journal]
  78. Shimon Even, Oded Goldreich
    On the Power of Cascade Ciphers [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 1985, v:3, n:2, pp:108-116 [Journal]

Search in 0.006secs, Finished in 0.010secs
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