Shimon Even

Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski: Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. Journal of Interconnection Networks 8(2): 101-118 (2007)

Maria Artishchev-Zapolotsky, Shimon Even, Vladimir Yanovski: Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. PDPTA 2005: 124-130

Yefim Dinitz, Shimon Even, Maria Zapolotsky: A Compact Layout of the Butterfly. Journal of Interconnection Networks 4(1): 53-75 (2003)

Shimon Even, Roni Kupershtok: Layout Area of the Hypercube. Journal of Interconnection Networks 4(4): 395-417 (2003)

Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar: Traversing Directed Eulerian Mazes. J. Graph Algorithms Appl. 6(2): 157-173 (2002)

Shimon Even, Roni Kupershtok: Laying Out the Interconnection Network of the Transpose Bijection. Theory Comput. Syst. 35(5): 545-558 (2002)

Shimon Even, Roni Kupershtok: Layout area of the hypercube (extended abstract). SODA 2002: 366-371

Shimon Even: Area efficient layouts of the Batcher sorting networks. Networks 38(4): 199-208 (2001)

Guy Even, Shimon Even: Embedding interconnection networks in grids via the layered cross product. Networks 36(2): 91-95 (2000)

Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar: Traversing Directed Eulerian Mazes. WG 2000: 35-46

Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky: Some Compact Layouts of the Butterfly. SPAA 1999: 54-63

Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg: A Tight Layout of the Butterfly Network. Theory Comput. Syst. 31(4): 475-488 (1998)

Edward G. Coffman Jr., Shimon Even: A Note on Limited Preemption. Parallel Processing Letters 8(1): 3-6 (1998)

Shimon Even, Ami Litman, Arnold L. Rosenberg: Monochromatic Paths and Triangulated Graphs. SIAM J. Discrete Math. 11(4): 546-556 (1998)

Shimon Even, Gene Itkis, Sergio Rajsbaum: On Mixed Connectivity Certificates. Theor. Comput. Sci. 203(2): 253-269 (1998)

Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp: Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA 1998: 172-181

Shimon Even, Ami Litman, Peter Winkler: Computing with Snakes in Directed Networks of Automata. J. Algorithms 24(1): 158-170 (1997)

Shimon Even, Yishay Mansour: A Construction of a Cipher from a Single Pseudorandom Permutation. J. Cryptology 10(3): 151-162 (1997)

Shimon Even, Sergio Rajsbaum: The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks. Theory Comput. Syst. 30(5): 447-474 (1997)

Shimon Even, Ami Litman: Layered cross product - A technique to construct interconnection networks. Networks 29(4): 219-223 (1997)

Guy Even, Shimon Even: Embedding Interconnection Networks in Grids via the Layered Cross Product. CIAC 1997: 3-12

Shimon Even, Oded Goldreich, Silvio Micali: On-Line/Off-Line Digital Signatures. J. Cryptology 9(1): 35-67 (1996)

Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg: A Tight Layout of the Butterfly Network. SPAA 1996: 170-175

Shimon Even, Sergio Rajsbaum: Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. Mathematical Systems Theory 28(5): 421-435 (1995)

Shimon Even, Gene Itkis, Sergio Rajsbaum: On Mixed Connectivity Certificates (Extended Abstract). ESA 1995: 1-16

Shimon Even, Ami Litman: On the Capabilities of Systolic Systems. Mathematical Systems Theory 27(1): 3-28 (1994)

Shimon Even, Ami Litman: A Unified Scheme for Routing in Expander Based Networks. CIAC 1994: 125-135

Shimon Even, G. Granot: Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection. Graph Drawing 1994: 64-75

Shimon Even, Ami Litman: Layered Cross Product - A Technique to Construct Interconnection Networks. SPAA 1992: 60-69

Shimon Even, Yishay Mansour: A Construction of a Cioher From a Single Pseudorandom Permutation. ASIACRYPT 1991: 210-224

Shimon Even, Ami Litman: On the Capabilities of Systolic Systems (Extended Abstract). SPAA 1991: 357-367

Shimon Even: Systolic Modular Multiplication. CRYPTO 1990: 619-624

Shimon Even, Ami Litman, Peter Winkler: Computing with Snakes in Directed Networks of Automata (Extended Abstract). FOCS 1990: 740-745

Shimon Even, Sergio Rajsbaum: The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract). STOC 1990: 95-105

Shimon Even, Oded Goldreich, Silvio Micali: On-Line/Off-Line Digital Schemes. CRYPTO 1989: 263-275

Shimon Even, Burkhard Monien: On the Number of Rounds Necessary to Disseminate Information. SPAA 1989: 318-327

Shimon Even, Oded Goldreich, Abraham Lempel: A Randomized Protocol for Signing Contracts. Commun. ACM 28(6): 637-647 (1985)

Shimon Even, Alan L. Selman, Yacov Yacobi: Hard-Core Theorems for Complexity Classes. J. ACM 32(1): 205-217 (1985)

Shimon Even, Oded Goldreich: On the Power of Cascade Ciphers. ACM Trans. Comput. Syst. 3(2): 108-116 (1985)

Shimon Even, Oded Goldreich, Adi Shamir: On the Security of Ping-Pong Protocols when Implemented using the RSA. CRYPTO 1985: 58-72

Shimon Even, Alan L. Selman, Yacov Yacobi: The Complexity of Promise Problems with Applications to Public-Key Cryptography. Information and Control 61(2): 159-173 (1984)

Shimon Even, Oded Goldreich, Shlomo Moran, Po Tong: On the np-completeness of certain network testing problems. Networks 14(1): 1-24 (1984)

Shimon Even, Oded Goldreich: Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). IEEE Transactions on Information Theory 30(5): 780- (1984)

Baruch Awerbuch, Shimon Even: Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. PODC 1984: 278-281

Shimon Even, Oded Goldreich: DES-like functions can generate the alternating group. IEEE Transactions on Information Theory 29(6): 863-865 (1983)

Shimon Even, Oded Goldreich: On the Power of Cascade Ciphers. CRYPTO 1983: 43-50

Shimon Even, Oded Goldreich: Electronic Wallet. CRYPTO 1983: 383-386

Shimon Even, Oded Goldreich: On the Security of Multi-Party Ping-Pong Protocols. FOCS 1983: 34-39

Danny Dolev, Shimon Even, Richard M. Karp: On the Security of Ping-Pong Protocols. Information and Control 55(1-3): 57-68 (1982)

Shimon Even, Timothy J. Long, Yacov Yacobi: A Note on Deterministic and Nondeterministic Time Complexity. Information and Control 55(1-3): 117-124 (1982)

Danny Dolev, Shimon Even, Richard M. Karp: On the Security of Ping-Pong Protocols. CRYPTO 1982: 177-186

Shimon Even, Oded Goldreich, Abraham Lempel: A Randomized Protocol for Signing Contracts. CRYPTO 1982: 205-210

Shimon Even, Oded Goldreich: On the Security of Multi-Party Ping-Pong Protocols. CRYPTO 1982: 315

Reuven Bar-Yehuda, Shimon Even: On Approximating a Vertex Cover for Planar Graphs. STOC 1982: 303-309

Shimon Even, Yossi Shiloach: An On-Line Edge-Deletion Problem. J. ACM 28(1): 1-4 (1981)

Michael Rodeh, Vaughan R. Pratt, Shimon Even: Linear Algorithm for Data Compression via String Matching. J. ACM 28(1): 16-24 (1981)

Reuven Bar-Yehuda, Shimon Even: A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. J. Algorithms 2(2): 198-203 (1981)

Shimon Even, Oded Goldreich: The Minimum-Length Generator Sequence Problem is NP-Hard. J. Algorithms 2(3): 311-313 (1981)

Shimon Even: Protocol for Signing Contracts. CRYPTO 1981: 148-153

Shimon Even, Oded Kariv (Eds.): Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings. Lecture Notes in Computer Science 115, Springer 1981, isbn 3-540-10843-2

Shimon Even, Yacov Yacobi: Cryptocomplexity and NP-Completeness. ICALP 1980: 195-207

Shimon Even, Yacov Yacobi: An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. WG 1980: 270-278

Shimon Even, Michael Rodeh: Economical Encoding of Commas Between Strings. Commun. ACM 21(4): 315-317 (1978)

Shimon Even: The Max Flow of Dinic and Karzanov: An Exposition. Jerusalem Conference on Information Technology 1978: 233-237

Shimon Even, Robert Endre Tarjan: Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344. Theor. Comput. Sci. 4(1): 123 (1977)

Shimon Even, Robert Endre Tarjan: A Combinatorial Problem Which Is Complete in Polynomial Space. J. ACM 23(4): 710-719 (1976)

Gideon Ehrlich, Shimon Even, Robert Endre Tarjan: Intersection graphs of curves in the plane. J. Comb. Theory, Ser. B 21(1): 8-20 (1976)

Shimon Even, Alon Itai, Adi Shamir: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5(4): 691-703 (1976)

Shimon Even, Robert Endre Tarjan: Computing an st -Numbering. Theor. Comput. Sci. 2(3): 339-344 (1976)

Yehoshua Perl, M. R. Garey, Shimon Even: Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters. J. ACM 22(2): 202-214 (1975)

Shimon Even: An Algorithm for Determining Whether the Connectivity of a Graph is at Least k. SIAM J. Comput. 4(3): 393-396 (1975)

Shimon Even, Robert Endre Tarjan: Network Flow and Testing Graph Connectivity. SIAM J. Comput. 4(4): 507-518 (1975)

Shimon Even, Oded Kariv: An O(n^2.5) Algorithm for Maximum Matching in General Graphs. FOCS 1975: 100-112

Shimon Even, Alon Itai, Adi Shamir: On the Complexity of Timetable and Multi-Commodity Flow Problems. FOCS 1975: 184-193

Shimon Even, Robert Endre Tarjan: a Combinatorial Problem which is Complete in Polynomial Space. STOC 1975: 66-71

Shimon Even: Parallelism in Tape-Sorting. Commun. ACM 17(4): 202-204 (1974)

Shimon Even, Abraham Lempel: Generation and Enumeration of All Solutions of the Characteristic Sum Condition. Information and Control 21(5): 476-482 (1972)

Shimon Even, Amir Pnueli, Abraham Lempel: Permutation Graphs and Transitive Graphs. J. ACM 19(3): 400-410 (1972)

F. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli: Marked Directed Graphs. J. Comput. Syst. Sci. 5(5): 511-523 (1971)

Shimon Even, I. Kohavi, Azaria Paz: On Minimal Modulo 2 Sums of Products for Switching Functions. SWAT (FOCS) 1966: 201-206

Shimon Even: Generalized automata and their information losslessness. SWCT (FOCS) 1962: 143-147