Shimon Even | Academic Influence

Shimon Even's AcademicInfluence.com Rankings

Shimon Even

Computer Science

#578

World Rank

#598

Historical Rank

Database

#697

World Rank

#731

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Shimon Even's Degrees

PhD Computer Science University of California, Berkeley
Masters Computer Science University of California, Berkeley

Similar Degrees You Can Earn

Why Is Shimon Even Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Shimon Even was an Israeli computer science researcher. His main topics of interest included algorithms, graph theory and cryptography. He was a member of the Computer Science Department at the Technion since 1974. Shimon Even was the PhD advisor of Oded Goldreich, a prominent cryptographer.

(See a Problem?)

Shimon Even's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A randomized protocol for signing contracts (1985) (1469)
On the Complexity of Timetable and Multicommodity Flow Problems (1976) (1103)
Graph Algorithms (1979) (1043)
Network Flow and Testing Graph Connectivity (1975) (567)
Marked Directed Graphs (1971) (513)
On-line/off-line digital signatures (1996) (428)
On the complexity of time table and multi-commodity flow problems (1975) (424)
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem (1981) (420)
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem (1983) (408)
A construction of a cipher from a single pseudorandom permutation (1997) (345)
Computing an st -Numbering (1976) (284)
An On-Line Edge-Deletion Problem (1981) (276)
Transitive Orientation of Graphs and Identification of Permutation Graphs (1971) (274)
The Complexity of Promise Problems with Applications to Public-Key Cryptography (1984) (260)
An O (N2.5) algorithm for maximum matching in general graphs (1975) (238)
Linear Algorithm for Data Compression via String Matching (1981) (232)
Permutation Graphs and Transitive Graphs (1972) (176)
Bounds for the Optimal Scheduling of n Jobs on m Processors (1964) (164)
On the security of multi-party ping-pong protocols (1983) (155)
QUEUES, STACKS AND GRAPHS (1971) (148)
On-Line/Off-Line Digital Schemes (1989) (144)
A note on cake cutting (1984) (141)
A Combinatorial Problem Which Is Complete in Polynomial Space (1976) (140)
On the Security of Ping-Pong Protocols (1982) (130)
Intersection graphs of curves in the plane (1976) (129)
Updating distances in dynamic graphs (1985) (119)
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k (1973) (116)
A Construction of a Cioher From a Single Pseudorandom Permutation (1991) (115)
On the np-completeness of certain network testing problems (1984) (108)
Ambiguity in Graphs and Expressions (1971) (94)
On the power of cascade ciphers (1985) (93)
The Minimum-Length Generator Sequence Problem is NP-Hard (1981) (89)
Graph Algorithms: Contents (2011) (79)
On the number of rounds necessary to disseminate information (1989) (75)
On Minimal Modulo 2 Sums of Products for Switching Functions (1966) (69)
A protocol for signing contracts (1983) (66)
Derangements and Laguerre polynomials (1976) (64)
Economical encoding of commas between strings (1978) (59)
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. (1984) (55)
On Information Lossless Automata of Finite Order (1965) (52)
Cryptocomplexity and NP-Completeness (1980) (51)
DES-like functions can generate the alternating group (1983) (47)
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters (1975) (46)
On approximating a vertex cover for planar graphs (1982) (42)
A Tight Layout of the Butterfly Network (1996) (39)
Graph Algorithms: Flow in Networks (2011) (37)
A combinatorial problem which is complete in polynomial space (1975) (37)
On the Security of Ping-Pong Protocols when Implemented using the RSA (1985) (34)
Electronic Wallet (1983) (32)
Traversing Directed Eulerian Mazes (2000) (31)
Hard-core theorems for complexity classes (1985) (29)
The use of a synchronizer yields the maximum computation rate in distributed networks (1990) (28)
An algorithm for optimal prefix parsing of a noiseless and memoryless channel (1973) (28)
Efficient and reliable broadcast is achievable in an eventually connected network(Extended Abstract) (1984) (27)
Parallelism in tape-sorting (1974) (27)
Computing with snakes in directed networks of automata (1990) (27)
Comments on the Minimization of Stochastic Machines (1965) (23)
Identification and Minimization of Linear Machines (1965) (22)
Tests for unique decipherability (1963) (21)
Generation and Enumeration of All Solutions of the Characteristic Sum Condition (1972) (21)
Test for synchronizability of finite automata and variable length codes (1964) (20)
Layered cross product&mdashA technique to construct interconnection networks (1997) (19)
Layered cross product - A technique to construct interconnection networks (1997) (18)
Systolic Modular Multiplication (1990) (18)
Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems (1970) (17)
Sequential Boolean Equations (1969) (16)
Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection (1994) (16)
Layered cross product—a technique to construct interconnection networks (1992) (15)
Generalized automata and their information losslessness (1962) (14)
Rational Numbers and Regular Events (1964) (14)
Some compact layouts of the butterfly (1999) (13)
Snake in the Box Codes (1963) (13)
On synchronizable and PSK-synchronizable block codes (1964) (13)
On the Number of Partitionings of a Set of n Distinct Objects (1962) (12)
Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344 (1977) (10)
Graph Algorithms, Second Edition (2012) (10)
A Systematic Design and Explanation of the Atrubin Multiplier (1993) (9)
A Gray Code Counter (1969) (9)
On a Problem of Diagnosis (1967) (9)
On Mixed Connectivity Certificates (1998) (8)
How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions (1990) (8)
Unison, canon, and sluggish clocks in networks controlled by a synchronizer (1995) (8)
Unison in distributed networks (1990) (8)
Layout of the batcher bitonic sorter (extended abstract) (1998) (7)
Layout of the Batcher Bitonic Sorter (1998) (7)
Layout Area of the Hypercube (2003) (7)
Graph Algorithms: Depth-First Search (2011) (7)
Area efficient layouts of the Batcher sorting networks (2001) (6)
The Max Flow of Dinic and Karzanov: An Exposition (1978) (5)
On the capabilities of systolic systems (2005) (5)
"The Price is Right" Game (1966) (5)
A Compact Layout of the Butterfly (2003) (4)
Laying Out the Interconnection Network of the Transpose Bijection (2002) (4)
The Design of Shift Register Generators for Finite Sequences (1969) (4)
Embedding interconnection networks in grids via the layered cross product (1997) (3)
A Note on Deterministic and Nondeterministic Time Complexity (1982) (3)
Proceedings of the 8th Colloquium on Automata, Languages and Programming (1981) (2)
Graph Algorithms: Paths in Graphs (2011) (2)
On the capabilities of systolic systems (extended abstract) (1991) (2)
Graph Algorithms: Applications of Network Flow Techniques (2011) (2)
The Stability of Counting Sequences Under Stage Delays (1971) (1)
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area (2007) (1)
Monochromatic Paths and Triangulated Graphs (1998) (1)
A CONSTRUCTION OF A CIPHER FROM A (1991) (1)
A Note on Limited Preemption (1998) (1)
Automata, languages and programming : eighth colloquium, Acre (Akko), Israel, July 13-17, 1981 (1981) (1)
On the Correspondence Between Simplest Disjunctive and Conjunctive Forms and Simplest Stroke and Daggar Functions (1961) (1)
A continued fraction generator for smooth pulse sequences (1971) (1)
An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography (1980) (1)
On the Complexity of Some Word Problems That Arise in Testing the Security of Protocols (1985) (1)
Layout area of the hypercube: (extended abstract) (2002) (1)
On Protocols for Cake Cutting (1981) (0)
A Unified Scheme for Routing in Expander Based Networks (1994) (0)
Area efficient layouts of the Batcher sorting networks Part of this work was done at Bell-Labs, Lucent Technologies, while the author was on leave from the Technion (2001) (0)
Four value-adding algorithms (1998) (0)
Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865) (1984) (0)
Graph Algorithms: Ordered Trees (2011) (0)
Graph Algorithms: Trees (2011) (0)
On the Complexitx of Problems with Few Solutions .** Electrical (0)
MONOCHROMATIC PATHS AND TRIANGULATED (1995) (0)
DES-Like Functions Can Generate the 863 Alternating Group (1998) (0)
Some further results on synchronizable block codes (Corresp.) (1966) (0)
Automata, Languages and Programming (1981) (0)
On Mixed Connectivity Certificates (Extended Abstract) (1995) (0)
Test for Planarity of a Circuit Given by an Expression (1966) (0)
Graph Algorithms: Testing Graph Planarity (2011) (0)

This paper list is powered by the following services:

Other Resources About Shimon Even

en.wikipedia.org

What Schools Are Affiliated With Shimon Even?

Shimon Even is affiliated with the following schools:

Image Attributions

Image Source for Shimon Even