Generalized automata and their information losslessness - Shimon Even (SWCT, 1962)

Tests for unique decipherability. - Shimon Even (IEEE Trans. Inf. Theory, 1963)

Rational Numbers and Regular Events. - Shimon Even (IEEE Trans. Electron. Comput., 1964)

On synchronizable and PSK-synchronizable block codes. - Willard L. Eastman; Shimon Even (IEEE Trans. Inf. Theory, 1964)

Test for synchronizability of finite automata and variable length codes. - Shimon Even (IEEE Trans. Inf. Theory, 1964)

Identification and Minimization of Linear Machines. - Martin Cohn; Shimon Even (IEEE Trans. Electron. Comput., 1965)

On Information Lossless Automata of Finite Order. - Shimon Even (IEEE Trans. Electron. Comput., 1965)

Comments on the Minimization of Stochastic Machines. - Shimon Even (IEEE Trans. Electron. Comput., 1965)

Test for Planarity of a Circuit Given by an Expression. - Shimon Even; Albert R. Meyer (IEEE Trans. Electron. Comput., 1966)

Some further results on synchronizable block codes (Corresp.). - Willard L. Eastman; Shimon Even (IEEE Trans. Inf. Theory, 1966)

On Minimal Modulo 2 Sums of Products for Switching Functions. - Shimon Even; Igal Kohavi; Azaria Paz (IEEE Trans. Electron. Comput., 1967)

The Design of Shift Register Generators for Finite Sequences. - Martin Cohn; Shimon Even (IEEE Trans. Computers, 1969)

A Gray Code Counter. - Martin Cohn; Shimon Even (IEEE Trans. Computers, 1969)

Sequential Boolean Equations. - Shimon Even; Albert R. Meyer (IEEE Trans. Computers, 1969)

Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems. - Francesco Brioschi; Shimon Even (Oper. Res., 1970)

Marked Directed Graphs. - Frederic G. Commoner; Anatol W. Holt; Shimon Even; Amir Pnueli (J. Comput. Syst. Sci., 1971)

Ambiguity in Graphs and Expressions. - Ronald Vernon Book; Shimon Even; Sheila A. Greibach; Gene Ott (IEEE Trans. Computers, 1971)

Permutation Graphs and Transitive Graphs. - Shimon Even; Amir Pnueli; Abraham Lempel (J. ACM, 1972)

Generation and Enumeration of All Solutions of the Characteristic Sum Condition - Shimon Even; Abraham Lempel (Inf. Control., 1972)

An algorithm for optimal prefix parsing of a noiseless and memoryless channel. - Abraham Lempel; Shimon Even; Martin Cohn (IEEE Trans. Inf. Theory, 1973)

Parallelism in Tape-Sorting. - Shimon Even (Commun. ACM, 1974)

On the Complexity of Timetable and Multi-Commodity Flow Problems - Shimon Even; Alon Itai; Adi Shamir (FOCS, 1975)

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

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

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

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

A Combinatorial Problem Which Is Complete in Polynomial Space. - Shimon Even; Robert Endre Tarjan (J. ACM, 1976)

Intersection graphs of curves in the plane. - Gideon Ehrlich; Shimon Even; Robert Endre Tarjan (J. Comb. Theory B, 1976)

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

Computing an st -Numbering. - Shimon Even; Robert Endre Tarjan (Theor. Comput. Sci., 1976)

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

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

Economical Encoding of Commas Between Strings. - Shimon Even; Michael Rodeh (Commun. ACM, 1978)

Cryptocomplexity and NP-Completeness. - Shimon Even; Yacov Yacobi (ICALP, 1980)

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

On Protocols for Cake Cutting. - Shimon Even (WG, 1981)

An On-Line Edge-Deletion Problem. - Shimon Even; Yossi Shiloach (J. ACM, 1981)

Linear Algorithm for Data Compression via String Matching. - Michael Rodeh; Vaughan R. Pratt; Shimon Even (J. ACM, 1981)

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

The Minimum-Length Generator Sequence Problem is NP-Hard. - Shimon Even; Oded Goldreich 001 (J. Algorithms, 1981)

On the Security of Multi-Party Ping-Pong Protocols. - Shimon Even; Oded Goldreich 001 (CRYPTO, 1982)

On Approximating a Vertex Cover for Planar Graphs - Reuven Bar-Yehuda; Shimon Even (STOC, 1982)

On the Security of Ping-Pong Protocols - Danny Dolev; Shimon Even; Richard M. Karp (Inf. Control., 1982)

A Note on Deterministic and Nondeterministic Time Complexity - Shimon Even; Timothy J. Long; Yacov Yacobi (Inf. Control., 1982)

Electronic Wallet. - Shimon Even; Oded Goldreich 001 (CRYPTO, 1983)

A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. - Reuven Bar-Yehuda; Shimon Even (WG, 1983)

A protocol for signing contracts. - Shimon Even (SIGACT News, 1983)

DES-like functions can generate the alternating group. - Shimon Even; Oded Goldreich 001 (IEEE Trans. Inf. Theory, 1983)

Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. - Baruch Awerbuch; Shimon Even (PODC, 1984)

A note on cake cutting. - Shimon Even; Azaria Paz (Discret. Appl. Math., 1984)

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

Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). - Shimon Even; Oded Goldreich 001 (IEEE Trans. Inf. Theory, 1984)

The Complexity of Promise Problems with Applications to Public-Key Cryptography - Shimon Even; Alan L. Selman; Yacov Yacobi (Inf. Control., 1984)

On the Security of Ping-Pong Protocols when Implemented using the RSA. - Shimon Even; Oded Goldreich 001; Adi Shamir (CRYPTO, 1985)

A Randomized Protocol for Signing Contracts. - Shimon Even; Oded Goldreich 001; Abraham Lempel (Commun. ACM, 1985)

On the Power of Cascade Ciphers - Shimon Even; Oded Goldreich 001 (ACM Trans. Comput. Syst., 1985)

Hard-Core Theorems for Complexity Classes - Shimon Even; Alan L. Selman; Yacov Yacobi (J. ACM, 1985)

On-Line/Off-Line Digital Schemes. - Shimon Even; Oded Goldreich 001; Silvio Micali (CRYPTO, 1989)

On the Number of Rounds Necessary to Disseminate Information. - Shimon Even; Burkhard Monien (SPAA, 1989)

Systolic Modular Multiplication. - Shimon Even (CRYPTO, 1990)

Computing with Snakes in Directed Networks of Automata (Extended Abstract) - Shimon Even; Ami Litman; Peter Winkler 001 (FOCS, 1990)

How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions. - Shimon Even; Yachin Pnueli (Jerusalem Conference on Information Technology, 1990)

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

A Construction of a Cioher From a Single Pseudorandom Permutation. - Shimon Even; Yishay Mansour (ASIACRYPT, 1991)

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

A Unified Scheme for Routing in Expander Based Networks. - Shimon Even; Ami Litman (CIAC, 1994)

Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection. - Shimon Even; G. Granot (GD, 1994)

On the Capabilities of Systolic Systems. - Shimon Even; Ami Litman (Math. Syst. Theory, 1994)

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

Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. - Shimon Even; Sergio Rajsbaum (Math. Syst. Theory, 1995)

On-Line/Off-Line Digital Signatures. - Shimon Even; Oded Goldreich 001; Silvio Micali (J. Cryptol., 1996)

Computing with Snakes in Directed Networks of Automata. - Shimon Even; Ami Litman; Peter Winkler 001 (J. Algorithms, 1997)

A Construction of a Cipher from a Single Pseudorandom Permutation. - Shimon Even; Yishay Mansour (J. Cryptol., 1997)

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

Layered cross product - A technique to construct interconnection networks. - Shimon Even; Ami Litman (Networks, 1997)

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

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

A Note on Limited Preemption. - Edward G. Coffman Jr.; Shimon Even (Parallel Process. Lett., 1998)

Monochromatic Paths and Triangulated Graphs. - Shimon Even; Ami Litman; Arnold L. Rosenberg (SIAM J. Discret. Math., 1998)

On Mixed Connectivity Certificates. - Shimon Even; Gene Itkis; Sergio Rajsbaum (Theor. Comput. Sci., 1998)

Some Compact Layouts of the Butterfly. - Yefim Dinitz; Shimon Even; Roni Kupershtok; Maria Zapolotsky (SPAA, 1999)

Embedding interconnection networks in grids via the layered cross product. - Guy Even; Shimon Even (Networks, 2000)

Area efficient layouts of the Batcher sorting networks. - Shimon Even (Networks, 2001)

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

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

Laying Out the Interconnection Network of the Transpose Bijection. - Shimon Even; Roni Kupershtok (Theory Comput. Syst., 2002)

A Compact Layout of the Butterfly. - Yefim Dinitz; Shimon Even; Maria Zapolotsky (J. Interconnect. Networks, 2003)

Layout Area of the Hypercube. - Shimon Even; Roni Kupershtok (J. Interconnect. Networks, 2003)

Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. - Maria Artishchev-Zapolotsky; Shimon Even; Vladimir Yanovski (PDPTA, 2005)

Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. - Maria Artishchev-Zapolotsky; Yefim Dinitz; Shimon Even; Vladimir Yanovski (J. Interconnect. Networks, 2007)

Graph Algorithms, Second Edition. - Shimon Even; Guy Even (Cambridge University Press, 2012)