Shimon Even

According to our database, Shimon Even authored at least 91 papers between 1962 and 2012.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2012

Graph Algorithms, Second Edition.

Shimon Even, Guy Even

Cambridge University Press, ISBN: 978-0-521-73653-4, 2012

2007

Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.

Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski

J. Interconnect. Networks, 2007

2005

Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.

Maria Artishchev-Zapolotsky, Shimon Even, Vladimir Yanovski

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2005

2003

Layout Area of the Hypercube.

Shimon Even, Roni Kupershtok

J. Interconnect. Networks, 2003

A Compact Layout of the Butterfly.

Yefim Dinitz, Shimon Even, Maria Zapolotsky

J. Interconnect. Networks, 2003

2002

Laying Out the Interconnection Network of the Transpose Bijection.

Shimon Even, Roni Kupershtok

Theory Comput. Syst., 2002

Traversing Directed Eulerian Mazes.

Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar

J. Graph Algorithms Appl., 2002

Layout area of the hypercube (extended abstract).

Shimon Even, Roni Kupershtok

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Area efficient layouts of the Batcher sorting networks.

Shimon Even

Networks, 2001

2000

Embedding interconnection networks in grids via the layered cross product.

Guy Even, Shimon Even

Networks, 2000

1999

Some Compact Layouts of the Butterfly.

Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky

Proceedings of the Eleventh Annual ACM Symposium on Parallel Algorithms and Architectures, 1999

1998

On Mixed Connectivity Certificates.

Shimon Even, Gene Itkis, Sergio Rajsbaum

Theor. Comput. Sci., 1998

Monochromatic Paths and Triangulated Graphs.

Shimon Even, Ami Litman, Arnold L. Rosenberg

SIAM J. Discret. Math., 1998

A Note on Limited Preemption.

Edward G. Coffman Jr., Shimon Even

Parallel Process. Lett., 1998

A Tight Layout of the Butterfly Network.

Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg

Theory Comput. Syst., 1998

Layout of the Batcher Bitonic Sorter (Extended Abstract).

Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

1997

Layered cross product - A technique to construct interconnection networks.

Shimon Even, Ami Litman

Networks, 1997

The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks.

Shimon Even, Sergio Rajsbaum

Theory Comput. Syst., 1997

A Construction of a Cipher from a Single Pseudorandom Permutation.

Shimon Even, Yishay Mansour

J. Cryptol., 1997

Computing with Snakes in Directed Networks of Automata.

Shimon Even, Ami Litman, Peter Winkler

J. Algorithms, 1997

1996

On-Line/Off-Line Digital Signatures.

Shimon Even, Oded Goldreich, Silvio Micali

J. Cryptol., 1996

1995

Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer.

Shimon Even, Sergio Rajsbaum

Math. Syst. Theory, 1995

On Mixed Connectivity Certificates (Extended Abstract).

Shimon Even, Gene Itkis, Sergio Rajsbaum

Proceedings of the Algorithms, 1995

1994

On the Capabilities of Systolic Systems.

Shimon Even, Ami Litman

Math. Syst. Theory, 1994

Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection.

Shimon Even, G. Granot

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

A Unified Scheme for Routing in Expander Based Networks.

Shimon Even, Ami Litman

Proceedings of the Algorithms and Complexity, Second Italian Conference, 1994

1991

On the Capabilities of Systolic Systems (Extended Abstract).

Shimon Even, Ami Litman

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

A Construction of a Cioher From a Single Pseudorandom Permutation.

Shimon Even, Yishay Mansour

Proceedings of the Advances in Cryptology, 1991

1990

The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract)

Shimon Even, Sergio Rajsbaum

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions.

Shimon Even, Yachin Pnueli

Proceedings of the Next Decade in Information Technology: Proceedings of the 5th Jerusalem Conference on Information Technology 1990, 1990

Computing with Snakes in Directed Networks of Automata (Extended Abstract)

Shimon Even, Ami Litman, Peter Winkler

Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

Systolic Modular Multiplication.

Shimon Even

Proceedings of the Advances in Cryptology, 1990

1989

On the Number of Rounds Necessary to Disseminate Information.

Shimon Even, Burkhard Monien

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

On-Line/Off-Line Digital Schemes.

Shimon Even, Oded Goldreich, Silvio Micali

Proceedings of the Advances in Cryptology, 1989

1985

Hard-Core Theorems for Complexity Classes

Shimon Even, Alan L. Selman, Yacov Yacobi

J. ACM, January, 1985

On the Power of Cascade Ciphers

Shimon Even, Oded Goldreich

ACM Trans. Comput. Syst., 1985

A Randomized Protocol for Signing Contracts.

Shimon Even, Oded Goldreich, Abraham Lempel

Commun. ACM, 1985

On the Security of Ping-Pong Protocols when Implemented using the RSA.

Shimon Even, Oded Goldreich, Adi Shamir

Proceedings of the Advances in Cryptology, 1985

1984

The Complexity of Promise Problems with Applications to Public-Key Cryptography

Shimon Even, Alan L. Selman, Yacov Yacobi

Inf. Control., May, 1984

Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865).

Shimon Even, Oded Goldreich

IEEE Trans. Inf. Theory, 1984

On the np-completeness of certain network testing problems.

Shimon Even, Oded Goldreich, Shlomo Moran, Po Tong

Networks, 1984

A note on cake cutting.

Shimon Even, Azaria Paz

Discret. Appl. Math., 1984

Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network.

Baruch Awerbuch, Shimon Even

Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1983

DES-like functions can generate the alternating group.

Shimon Even, Oded Goldreich

IEEE Trans. Inf. Theory, 1983

A protocol for signing contracts.

Shimon Even

SIGACT News, 1983

A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem.

Reuven Bar-Yehuda, Shimon Even

Proceedings of the WG '83, 1983

Electronic Wallet.

Shimon Even, Oded Goldreich

Proceedings of the Advances in Cryptology, 1983

1982

A Note on Deterministic and Nondeterministic Time Complexity

Shimon Even, Timothy J. Long, Yacov Yacobi

Inf. Control., 1982

On the Security of Ping-Pong Protocols

Danny Dolev, Shimon Even, Richard M. Karp

Inf. Control., 1982

On Approximating a Vertex Cover for Planar Graphs

Reuven Bar-Yehuda, Shimon Even

Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

On the Security of Multi-Party Ping-Pong Protocols.

Shimon Even, Oded Goldreich

Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

1981

The Minimum-Length Generator Sequence Problem is NP-Hard.

Shimon Even, Oded Goldreich

J. Algorithms, 1981

A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem.

Reuven Bar-Yehuda, Shimon Even

J. Algorithms, 1981

Linear Algorithm for Data Compression via String Matching.

Michael Rodeh, Vaughan R. Pratt, Shimon Even

J. ACM, 1981

An On-Line Edge-Deletion Problem.

Shimon Even, Yossi Shiloach

J. ACM, 1981

On Protocols for Cake Cutting.

Shimon Even

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

1980

An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography.

Shimon Even, Yacov Yacobi

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

Cryptocomplexity and NP-Completeness.

Shimon Even, Yacov Yacobi

Proceedings of the Automata, 1980

1978

Economical Encoding of Commas Between Strings.

Shimon Even, Michael Rodeh

Commun. ACM, 1978

The Max Flow of Dinic and Karzanov: An Exposition.

Shimon Even

Proceedings of the Information Technology '78: Proceedings of the 3rd Jerusalem Conference on Information Technology (JCIT3), 1978

1977

Corrigendum: Computing an <i>st</i>-Numbering. TCS 2(1976):339-344.

Shimon Even, Robert Endre Tarjan

Theor. Comput. Sci., 1977

1976

Computing an <i> st </i> -Numbering.

Shimon Even, Robert Endre Tarjan

Theor. Comput. Sci., 1976

On the Complexity of Timetable and Multicommodity Flow Problems.

Shimon Even, Alon Itai, Adi Shamir

SIAM J. Comput., 1976

Intersection graphs of curves in the plane.

Gideon Ehrlich, Shimon Even, Robert Endre Tarjan

J. Comb. Theory B, 1976

A Combinatorial Problem Which Is Complete in Polynomial Space.

Shimon Even, Robert Endre Tarjan

J. ACM, 1976

1975

Network Flow and Testing Graph Connectivity.

Shimon Even, Robert Endre Tarjan

SIAM J. Comput., 1975

An Algorithm for Determining Whether the Connectivity of a Graph is at Least k.

Shimon Even

SIAM J. Comput., 1975

Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters.

Yehoshua Perl, M. R. Garey, Shimon Even

J. ACM, 1975

An O(n^2.5) Algorithm for Maximum Matching in General Graphs

Shimon Even, Oded Kariv

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

On the Complexity of Timetable and Multi-Commodity Flow Problems

Shimon Even, Alon Itai, Adi Shamir

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974

Parallelism in Tape-Sorting.

Shimon Even

Commun. ACM, 1974

1973

An algorithm for optimal prefix parsing of a noiseless and memoryless channel.

Abraham Lempel, Shimon Even, Martin Cohn

IEEE Trans. Inf. Theory, 1973

1972

Generation and Enumeration of All Solutions of the Characteristic Sum Condition

Shimon Even, Abraham Lempel

Inf. Control., December, 1972

Permutation Graphs and Transitive Graphs.

Shimon Even, Amir Pnueli, Abraham Lempel

J. ACM, 1972

1971

Ambiguity in Graphs and Expressions.

Ronald Vernon Book, Shimon Even, Sheila A. Greibach, Gene Ott

IEEE Trans. Computers, 1971

Marked Directed Graphs.

Frederic G. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli

J. Comput. Syst. Sci., 1971

1970

Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems.

Francesco Brioschi, Shimon Even

Oper. Res., 1970

1969

Sequential Boolean Equations.

Shimon Even, Albert R. Meyer

IEEE Trans. Computers, 1969

A Gray Code Counter.

Martin Cohn, Shimon Even

IEEE Trans. Computers, 1969

The Design of Shift Register Generators for Finite Sequences.

Martin Cohn, Shimon Even

IEEE Trans. Computers, 1969

1967

On Minimal Modulo 2 Sums of Products for Switching Functions.

Shimon Even, Igal Kohavi, Azaria Paz

IEEE Trans. Electron. Comput., 1967

1966

Some further results on synchronizable block codes (Corresp.).

Willard L. Eastman, Shimon Even

IEEE Trans. Inf. Theory, 1966

Test for Planarity of a Circuit Given by an Expression.

Shimon Even, Albert R. Meyer

IEEE Trans. Electron. Comput., 1966

1965

Comments on the Minimization of Stochastic Machines.

Shimon Even

IEEE Trans. Electron. Comput., 1965

On Information Lossless Automata of Finite Order.

Shimon Even

IEEE Trans. Electron. Comput., 1965

Identification and Minimization of Linear Machines.

Martin Cohn, Shimon Even

IEEE Trans. Electron. Comput., 1965

1964

Test for synchronizability of finite automata and variable length codes.

Shimon Even

IEEE Trans. Inf. Theory, 1964

On synchronizable and PSK-synchronizable block codes.

Willard L. Eastman, Shimon Even

IEEE Trans. Inf. Theory, 1964

Rational Numbers and Regular Events.

Shimon Even

IEEE Trans. Electron. Comput., 1964

1963

Tests for unique decipherability.

Shimon Even

IEEE Trans. Inf. Theory, 1963

1962

Generalized automata and their information losslessness

Shimon Even

Proceedings of the 3rd Annual Symposium on Switching Circuit Theory and Logical Design, 1962