Shimon Even

Publication Activity (10 Years)

Years Active: 1962-2007
Publications (10 Years): 0

Publications

Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. J. Interconnect. Networks 8 (2) (2007)
Maria Artishchev-Zapolotsky, Shimon Even, Vladimir Yanovski
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. PDPTA (2005)
Yefim Dinitz, Shimon Even, Maria Zapolotsky
A Compact Layout of the Butterfly. J. Interconnect. Networks 4 (1) (2003)
Shimon Even, Roni Kupershtok
Layout Area of the Hypercube. J. Interconnect. Networks 4 (4) (2003)
Shimon Even, Roni Kupershtok
Laying Out the Interconnection Network of the Transpose Bijection. Theory Comput. Syst. 35 (5) (2002)
Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar
Traversing Directed Eulerian Mazes. J. Graph Algorithms Appl. 6 (2) (2002)
Shimon Even, Roni Kupershtok
Layout area of the hypercube (extended abstract). SODA (2002)
Shimon Even
Area efficient layouts of the Batcher sorting networks. Networks 38 (4) (2001)
Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar
Traversing Directed Eulerian Mazes. WG (2000)
Guy Even, Shimon Even
Embedding interconnection networks in grids via the layered cross product. Networks 36 (2) (2000)
Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky
Some Compact Layouts of the Butterfly. SPAA (1999)
Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp
Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA (1998)
Edward G. Coffman Jr., Shimon Even
A Note on Limited Preemption. Parallel Process. Lett. 8 (1) (1998)
Shimon Even, Gene Itkis, Sergio Rajsbaum
On Mixed Connectivity Certificates. Theor. Comput. Sci. 203 (2) (1998)
Shimon Even, Ami Litman, Arnold L. Rosenberg
Monochromatic Paths and Triangulated Graphs. SIAM J. Discret. Math. 11 (4) (1998)
Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg
A Tight Layout of the Butterfly Network. Theory Comput. Syst. 31 (4) (1998)
Guy Even, Shimon Even
Embedding Interconnection Networks in Grids via the Layered Cross Product. CIAC (1997)
Shimon Even, Ami Litman
Layered cross product - A technique to construct interconnection networks. Networks 29 (4) (1997)
Shimon Even, Sergio Rajsbaum
The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks. Theory Comput. Syst. 30 (5) (1997)
Shimon Even, Yishay Mansour
A Construction of a Cipher from a Single Pseudorandom Permutation. J. Cryptol. 10 (3) (1997)
Shimon Even, Ami Litman, Peter Winkler
Computing with Snakes in Directed Networks of Automata. J. Algorithms 24 (1) (1997)
Shimon Even, Oded Goldreich, Silvio Micali
On-Line/Off-Line Digital Signatures. J. Cryptol. 9 (1) (1996)
Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg
A Tight Layout of the Butterfly Network. SPAA (1996)
Shimon Even, Gene Itkis, Sergio Rajsbaum
On Mixed Connectivity Certificates (Extended Abstract). ESA (1995)
Shimon Even, Sergio Rajsbaum
Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. Math. Syst. Theory 28 (5) (1995)
Shimon Even, G. Granot
Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection. Graph Drawing (1994)
Shimon Even, Ami Litman
On the Capabilities of Systolic Systems. Math. Syst. Theory 27 (1) (1994)
Shimon Even, Ami Litman
A Unified Scheme for Routing in Expander Based Networks. CIAC (1994)
Shimon Even, Ami Litman
Layered Cross Product - A Technique to Construct Interconnection Networks. SPAA (1992)
Shimon Even, Yishay Mansour
A Construction of a Cioher From a Single Pseudorandom Permutation. ASIACRYPT (1991)
Shimon Even, Ami Litman
On the Capabilities of Systolic Systems (Extended Abstract). SPAA (1991)
Shimon Even, Ami Litman, Peter Winkler
Computing with Snakes in Directed Networks of Automata (Extended Abstract) FOCS (1990)
Shimon Even
Systolic Modular Multiplication. CRYPTO (1990)
Shimon Even, Sergio Rajsbaum
The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract) STOC (1990)
Shimon Even, Yachin Pnueli
How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions. Jerusalem Conference on Information Technology (1990)
Shimon Even, Oded Goldreich, Silvio Micali
On-Line/Off-Line Digital Schemes. CRYPTO (1989)
Shimon Even, Burkhard Monien
On the Number of Rounds Necessary to Disseminate Information. SPAA (1989)
Shimon Even, Oded Goldreich, Adi Shamir
On the Security of Ping-Pong Protocols when Implemented using the RSA. CRYPTO (1985)
Shimon Even, Oded Goldreich
On the Power of Cascade Ciphers ACM Trans. Comput. Syst. 3 (2) (1985)
Shimon Even, Oded Goldreich, Abraham Lempel
A Randomized Protocol for Signing Contracts. Commun. ACM 28 (6) (1985)
Shimon Even, Alan L. Selman, Yacov Yacobi
Hard-Core Theorems for Complexity Classes J. ACM 32 (1) (1985)
Shimon Even, Oded Goldreich
Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). IEEE Trans. Inf. Theory 30 (5) (1984)
Shimon Even, Alan L. Selman, Yacov Yacobi
The Complexity of Promise Problems with Applications to Public-Key Cryptography Inf. Control. 61 (2) (1984)
Shimon Even, Azaria Paz
A note on cake cutting. Discret. Appl. Math. 7 (3) (1984)
Baruch Awerbuch, Shimon Even
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. PODC (1984)
Shimon Even, Oded Goldreich, Shlomo Moran, Po Tong
On the np-completeness of certain network testing problems. Networks 14 (1) (1984)
Shimon Even, Oded Goldreich
On the Power of Cascade Ciphers. CRYPTO (1983)
Shimon Even
A protocol for signing contracts. SIGACT News 15 (1) (1983)
Reuven Bar-Yehuda, Shimon Even
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. WG (1983)
Shimon Even, Oded Goldreich
Electronic Wallet. CRYPTO (1983)
Shimon Even, Oded Goldreich
On the Security of Multi-Party Ping-Pong Protocols FOCS (1983)
Shimon Even, Oded Goldreich
DES-like functions can generate the alternating group. IEEE Trans. Inf. Theory 29 (6) (1983)
Reuven Bar-Yehuda, Shimon Even
On Approximating a Vertex Cover for Planar Graphs STOC (1982)
Danny Dolev, Shimon Even, Richard M. Karp
On the Security of Ping-Pong Protocols. CRYPTO (1982)
Shimon Even, Oded Goldreich
On the Security of Multi-Party Ping-Pong Protocols. CRYPTO (1982)
Shimon Even, Oded Goldreich, Abraham Lempel
A Randomized Protocol for Signing Contracts. CRYPTO (1982)
Shimon Even, Timothy J. Long, Yacov Yacobi
A Note on Deterministic and Nondeterministic Time Complexity Inf. Control. 55 (1-3) (1982)
Danny Dolev, Shimon Even, Richard M. Karp
On the Security of Ping-Pong Protocols Inf. Control. 55 (1-3) (1982)
Shimon Even
Protocol for Signing Contracts. CRYPTO (1981)
Shimon Even, Yossi Shiloach
An On-Line Edge-Deletion Problem. J. ACM 28 (1) (1981)
Shimon Even, Oded Goldreich
The Minimum-Length Generator Sequence Problem is NP-Hard. J. Algorithms 2 (3) (1981)
Reuven Bar-Yehuda, Shimon Even
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. J. Algorithms 2 (2) (1981)
Michael Rodeh, Vaughan R. Pratt, Shimon Even
Linear Algorithm for Data Compression via String Matching. J. ACM 28 (1) (1981)
Shimon Even
On Protocols for Cake Cutting. WG (1981)
Shimon Even, Yacov Yacobi
An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. WG (1980)
Shimon Even, Yacov Yacobi
Cryptocomplexity and NP-Completeness. ICALP (1980)
Shimon Even
The Max Flow of Dinic and Karzanov: An Exposition. Jerusalem Conference on Information Technology (1978)
Shimon Even, Michael Rodeh
Economical Encoding of Commas Between Strings. Commun. ACM 21 (4) (1978)
Shimon Even, Robert Endre Tarjan
-Numbering. TCS 2(1976):339-344. Theor. Comput. Sci. 4 (1) (1977)
Shimon Even, Alon Itai, Adi Shamir
On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5 (4) (1976)
Shimon Even, Robert Endre Tarjan
A Combinatorial Problem Which Is Complete in Polynomial Space. J. ACM 23 (4) (1976)
Shimon Even, Robert Endre Tarjan
-Numbering. Theor. Comput. Sci. 2 (3) (1976)
Gideon Ehrlich, Shimon Even, Robert Endre Tarjan
Intersection graphs of curves in the plane. J. Comb. Theory, Ser. B 21 (1) (1976)
Shimon Even, Robert Endre Tarjan
Network Flow and Testing Graph Connectivity. SIAM J. Comput. 4 (4) (1975)
Yehoshua Perl, M. R. Garey, Shimon Even
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters. J. ACM 22 (2) (1975)
Shimon Even, Oded Kariv
An O(n^2.5) Algorithm for Maximum Matching in General Graphs FOCS (1975)
Shimon Even, Robert Endre Tarjan
a Combinatorial Problem which is Complete in Polynomial Space STOC (1975)
Shimon Even, Alon Itai, Adi Shamir
On the Complexity of Timetable and Multi-Commodity Flow Problems FOCS (1975)
Shimon Even
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k. SIAM J. Comput. 4 (3) (1975)
Shimon Even
Parallelism in Tape-Sorting. Commun. ACM 17 (4) (1974)
Abraham Lempel, Shimon Even, Martin Cohn
An algorithm for optimal prefix parsing of a noiseless and memoryless channel. IEEE Trans. Inf. Theory 19 (2) (1973)
Shimon Even, Abraham Lempel
Generation and Enumeration of All Solutions of the Characteristic Sum Condition Inf. Control. 21 (5) (1972)
Shimon Even, Amir Pnueli, Abraham Lempel
Permutation Graphs and Transitive Graphs. J. ACM 19 (3) (1972)
Ronald Vernon Book, Shimon Even, Sheila A. Greibach, Gene Ott
Ambiguity in Graphs and Expressions. IEEE Trans. Computers 20 (2) (1971)
F. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli
Marked Directed Graphs. J. Comput. Syst. Sci. 5 (5) (1971)
Francesco Brioschi, Shimon Even
Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems. Oper. Res. 18 (1) (1970)
Martin Cohn, Shimon Even
The Design of Shift Register Generators for Finite Sequences. IEEE Trans. Computers 18 (7) (1969)
Martin Cohn, Shimon Even
A Gray Code Counter. IEEE Trans. Computers 18 (7) (1969)
Shimon Even, Albert R. Meyer
Sequential Boolean Equations. IEEE Trans. Computers 18 (3) (1969)
Shimon Even, Igal Kohavi, Azaria Paz
On Minimal Modulo 2 Sums of Products for Switching Functions. IEEE Trans. Electron. Comput. 16 (5) (1967)
Willard L. Eastman, Shimon Even
Some further results on synchronizable block codes (Corresp.). IEEE Trans. Inf. Theory 12 (3) (1966)
Shimon Even, Igal Kohavi, Azaria Paz
On Minimal Modulo 2 Sums of Products for Switching Functions SWAT (1966)
Shimon Even, Albert R. Meyer
Test for Planarity of a Circuit Given by an Expression. IEEE Trans. Electron. Comput. 15 (3) (1966)
Shimon Even
On Information Lossless Automata of Finite Order. IEEE Trans. Electron. Comput. 14 (4) (1965)
Shimon Even
Comments on the Minimization of Stochastic Machines. IEEE Trans. Electron. Comput. 14 (4) (1965)
Martin Cohn, Shimon Even
Identification and Minimization of Linear Machines. IEEE Trans. Electron. Comput. 14 (3) (1965)
Shimon Even
Test for synchronizability of finite automata and variable length codes. IEEE Trans. Inf. Theory 10 (3) (1964)
Shimon Even
Rational Numbers and Regular Events. IEEE Trans. Electron. Comput. 13 (6) (1964)
Willard L. Eastman, Shimon Even
On synchronizable and PSK-synchronizable block codes. IEEE Trans. Inf. Theory 10 (4) (1964)
Shimon Even
Tests for unique decipherability. IEEE Trans. Inf. Theory 9 (2) (1963)

Shimon Even.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Shimon Even