| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski |
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area.  |
Journal of Interconnection Networks  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Artishchev-Zapolotsky, Shimon Even, Vladimir Yanovski |
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. |
PDPTA |
2005 |
DBLP BibTeX RDF |
|
| 1 | Yefim Dinitz, Shimon Even, Maria Zapolotsky |
A Compact Layout of the Butterfly. |
Journal of Interconnection Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Roni Kupershtok |
Layout Area of the Hypercube. |
Journal of Interconnection Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Roni Kupershtok |
Laying Out the Interconnection Network of the Transpose Bijection. |
Theory Comput. Syst. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar |
Traversing Directed Eulerian Mazes. |
J. Graph Algorithms Appl. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Roni Kupershtok |
Layout area of the hypercube (extended abstract). |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even |
Area efficient layouts of the Batcher sorting networks. |
Networks |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Shimon Even |
Embedding interconnection networks in grids via the layered cross product. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar |
Traversing Directed Eulerian Mazes. |
WG |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky |
Some Compact Layouts of the Butterfly. |
SPAA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Gene Itkis, Sergio Rajsbaum |
On Mixed Connectivity Certificates. |
Theor. Comput. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward G. Coffman Jr., Shimon Even |
A Note on Limited Preemption. |
Parallel Processing Letters |
1998 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Ami Litman, Arnold L. Rosenberg |
Monochromatic Paths and Triangulated Graphs. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg |
A Tight Layout of the Butterfly Network. |
Theory Comput. Syst. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp |
Layout of the Batcher Bitonic Sorter (Extended Abstract). |
SPAA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Ami Litman |
Layered cross product - A technique to construct interconnection networks. |
Networks |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Ami Litman, Peter Winkler |
Computing with Snakes in Directed Networks of Automata. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Yishay Mansour |
A Construction of a Cipher from a Single Pseudorandom Permutation. |
J. Cryptology |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Sergio Rajsbaum |
The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks. |
Theory Comput. Syst. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Even, Shimon Even |
Embedding Interconnection Networks in Grids via the Layered Cross Product. |
CIAC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich, Silvio Micali |
On-Line/Off-Line Digital Signatures. |
J. Cryptology |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg |
A Tight Layout of the Butterfly Network. |
SPAA |
1996 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Sergio Rajsbaum |
Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Gene Itkis, Sergio Rajsbaum |
On Mixed Connectivity Certificates (Extended Abstract). |
ESA |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Ami Litman |
On the Capabilities of Systolic Systems. |
Mathematical Systems Theory |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, G. Granot |
Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection. |
Graph Drawing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Ami Litman |
A Unified Scheme for Routing in Expander Based Networks. |
CIAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Ami Litman |
Layered Cross Product - A Technique to Construct Interconnection Networks. |
SPAA |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Ami Litman |
On the Capabilities of Systolic Systems (Extended Abstract). |
SPAA |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Yishay Mansour |
A Construction of a Cioher From a Single Pseudorandom Permutation. |
ASIACRYPT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even |
Systolic Modular Multiplication. |
CRYPTO |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Ami Litman, Peter Winkler |
Computing with Snakes in Directed Networks of Automata (Extended Abstract) |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
snakes', waking up, smart spanning trees, firing squad synchronization, protocols, finite-state automata, reporting, directed networks, breadth-first, depth-first |
| 1 | Shimon Even, Sergio Rajsbaum |
The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract) |
STOC |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Burkhard Monien |
On the Number of Rounds Necessary to Disseminate Information. |
SPAA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich, Silvio Micali |
On-Line/Off-Line Digital Schemes. |
CRYPTO |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich, Abraham Lempel |
A Randomized Protocol for Signing Contracts. |
Commun. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Alan L. Selman, Yacov Yacobi |
Hard-Core Theorems for Complexity Classes |
J. ACM |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich |
On the Power of Cascade Ciphers |
ACM Trans. Comput. Syst. |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich, Adi Shamir |
On the Security of Ping-Pong Protocols when Implemented using the RSA. |
CRYPTO |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Alan L. Selman, Yacov Yacobi |
The Complexity of Promise Problems with Applications to Public-Key Cryptography |
Information and Control |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich |
Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). |
IEEE Transactions on Information Theory |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Baruch Awerbuch, Shimon Even |
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. |
PODC |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich |
DES-like functions can generate the alternating group. |
IEEE Transactions on Information Theory |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich |
Electronic Wallet. |
CRYPTO |
1983 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich |
On the Power of Cascade Ciphers. |
CRYPTO |
1983 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich |
On the Security of Multi-Party Ping-Pong Protocols |
FOCS |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Dolev, Shimon Even, Richard M. Karp |
On the Security of Ping-Pong Protocols |
Information and Control |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Timothy J. Long, Yacov Yacobi |
A Note on Deterministic and Nondeterministic Time Complexity |
Information and Control |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich |
On the Security of Multi-Party Ping-Pong Protocols. |
CRYPTO |
1982 |
DBLP BibTeX RDF |
|
| 1 | Danny Dolev, Shimon Even, Richard M. Karp |
On the Security of Ping-Pong Protocols. |
CRYPTO |
1982 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich, Abraham Lempel |
A Randomized Protocol for Signing Contracts. |
CRYPTO |
1982 |
DBLP BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Shimon Even |
On Approximating a Vertex Cover for Planar Graphs |
STOC |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Goldreich |
The Minimum-Length Generator Sequence Problem is NP-Hard. |
J. Algorithms |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Shimon Even |
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. |
J. Algorithms |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Yossi Shiloach |
An On-Line Edge-Deletion Problem. |
J. ACM |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Rodeh, Vaughan R. Pratt, Shimon Even |
Linear Algorithm for Data Compression via String Matching. |
J. ACM |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Kariv (eds.) |
Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings |
ICALP |
1981 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even |
Protocol for Signing Contracts. |
CRYPTO |
1981 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Yacov Yacobi |
An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. |
WG |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Yacov Yacobi |
Cryptocomplexity and NP-Completeness. |
ICALP |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Michael Rodeh |
Economical Encoding of Commas Between Strings. |
Commun. ACM |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even |
The Max Flow of Dinic and Karzanov: An Exposition. |
Jerusalem Conference on Information Technology |
1978 |
DBLP BibTeX RDF |
|
| 1 | Shimon Even, Robert Endre Tarjan |
Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344. |
Theor. Comput. Sci. |
1977 |
DBLP BibTeX RDF |
|
| 1 | Gideon Ehrlich, Shimon Even, Robert Endre Tarjan |
Intersection graphs of curves in the plane. |
J. Comb. Theory, Ser. B |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Robert Endre Tarjan |
Computing an st -Numbering. |
Theor. Comput. Sci. |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Robert Endre Tarjan |
A Combinatorial Problem Which Is Complete in Polynomial Space. |
J. ACM |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Alon Itai, Adi Shamir |
On the Complexity of Timetable and Multicommodity Flow Problems. |
SIAM J. Comput. |
1976 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehoshua Perl, M. R. Garey, Shimon Even |
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters. |
J. ACM |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Robert Endre Tarjan |
Network Flow and Testing Graph Connectivity. |
SIAM J. Comput. |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even |
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k. |
SIAM J. Comput. |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Alon Itai, Adi Shamir |
On the Complexity of Timetable and Multi-Commodity Flow Problems |
FOCS |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Oded Kariv |
An O(n^2.5) Algorithm for Maximum Matching in General Graphs |
FOCS |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Robert Endre Tarjan |
a Combinatorial Problem which is Complete in Polynomial Space |
STOC |
1975 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even |
Parallelism in Tape-Sorting. |
Commun. ACM |
1974 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Abraham Lempel |
Generation and Enumeration of All Solutions of the Characteristic Sum Condition |
Information and Control |
1972 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, Amir Pnueli, Abraham Lempel |
Permutation Graphs and Transitive Graphs. |
J. ACM |
1972 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli |
Marked Directed Graphs. |
J. Comput. Syst. Sci. |
1971 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even, I. Kohavi, Azaria Paz |
On Minimal Modulo 2 Sums of Products for Switching Functions |
SWAT (FOCS) |
1966 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Even |
Generalized automata and their information losslessness |
SWCT (FOCS) |
1962 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")