Shimon Even

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