default search action
Shimon Even
Person information
- affiliation: Weizmann Institute of Science, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [b1]Shimon Even, Guy Even:
Graph Algorithms, Second Edition. Cambridge University Press 2012, ISBN 978-0-521-73653-4, pp. I-XII, 1-189
2000 – 2009
- 2007
- [j62]Maria Artishchev-Zapolotsky, Yefim Dinitz, Shimon Even, Vladimir Yanovski:
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. J. Interconnect. Networks 8(2): 101-118 (2007) - 2005
- [c39]Maria Artishchev-Zapolotsky, Shimon Even, Vladimir Yanovski:
Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. PDPTA 2005: 124-130 - 2003
- [j61]Yefim Dinitz, Shimon Even, Maria Zapolotsky:
A Compact Layout of the Butterfly. J. Interconnect. Networks 4(1): 53-75 (2003) - [j60]Shimon Even, Roni Kupershtok:
Layout Area of the Hypercube. J. Interconnect. Networks 4(4): 395-417 (2003) - 2002
- [j59]Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar:
Traversing Directed Eulerian Mazes. J. Graph Algorithms Appl. 6(2): 157-173 (2002) - [j58]Shimon Even, Roni Kupershtok:
Laying Out the Interconnection Network of the Transpose Bijection. Theory Comput. Syst. 35(5): 545-558 (2002) - [c38]Shimon Even, Roni Kupershtok:
Layout area of the hypercube (extended abstract). SODA 2002: 366-371 - 2001
- [j57]Shimon Even:
Area efficient layouts of the Batcher sorting networks. Networks 38(4): 199-208 (2001) - 2000
- [j56]Guy Even, Shimon Even:
Embedding interconnection networks in grids via the layered cross product. Networks 36(2): 91-95 (2000) - [c37]Sandeep N. Bhatt, Shimon Even, David S. Greenberg, Rafi Tayar:
Traversing Directed Eulerian Mazes. WG 2000: 35-46
1990 – 1999
- 1999
- [c36]Yefim Dinitz, Shimon Even, Roni Kupershtok, Maria Zapolotsky:
Some Compact Layouts of the Butterfly. SPAA 1999: 54-63 - 1998
- [j55]Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network. Theory Comput. Syst. 31(4): 475-488 (1998) - [j54]Edward G. Coffman Jr., Shimon Even:
A Note on Limited Preemption. Parallel Process. Lett. 8(1): 3-6 (1998) - [j53]Shimon Even, Ami Litman, Arnold L. Rosenberg:
Monochromatic Paths and Triangulated Graphs. SIAM J. Discret. Math. 11(4): 546-556 (1998) - [j52]Shimon Even, Gene Itkis, Sergio Rajsbaum:
On Mixed Connectivity Certificates. Theor. Comput. Sci. 203(2): 253-269 (1998) - [c35]Shimon Even, S. Muthukrishnan, Mike Paterson, Süleyman Cenk Sahinalp:
Layout of the Batcher Bitonic Sorter (Extended Abstract). SPAA 1998: 172-181 - 1997
- [j51]Shimon Even, Ami Litman, Peter Winkler:
Computing with Snakes in Directed Networks of Automata. J. Algorithms 24(1): 158-170 (1997) - [j50]Shimon Even, Yishay Mansour:
A Construction of a Cipher from a Single Pseudorandom Permutation. J. Cryptol. 10(3): 151-162 (1997) - [j49]Shimon Even, Sergio Rajsbaum:
The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks. Theory Comput. Syst. 30(5): 447-474 (1997) - [j48]Shimon Even, Ami Litman:
Layered cross product - A technique to construct interconnection networks. Networks 29(4): 219-223 (1997) - [c34]Guy Even, Shimon Even:
Embedding Interconnection Networks in Grids via the Layered Cross Product. CIAC 1997: 3-12 - 1996
- [j47]Shimon Even, Oded Goldreich, Silvio Micali:
On-Line/Off-Line Digital Signatures. J. Cryptol. 9(1): 35-67 (1996) - [c33]Aythan Avior, Tiziana Calamoneri, Shimon Even, Ami Litman, Arnold L. Rosenberg:
A Tight Layout of the Butterfly Network. SPAA 1996: 170-175 - 1995
- [j46]Shimon Even, Sergio Rajsbaum:
Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer. Math. Syst. Theory 28(5): 421-435 (1995) - [c32]Shimon Even, Gene Itkis, Sergio Rajsbaum:
On Mixed Connectivity Certificates (Extended Abstract). ESA 1995: 1-16 - 1994
- [j45]Shimon Even, Ami Litman:
On the Capabilities of Systolic Systems. Math. Syst. Theory 27(1): 3-28 (1994) - [c31]Shimon Even, Ami Litman:
A Unified Scheme for Routing in Expander Based Networks. CIAC 1994: 125-135 - [c30]Shimon Even, G. Granot:
Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection. GD 1994: 64-75 - 1992
- [c29]Shimon Even, Ami Litman:
Layered Cross Product - A Technique to Construct Interconnection Networks. SPAA 1992: 60-69 - 1991
- [c28]Shimon Even, Yishay Mansour:
A Construction of a Cioher From a Single Pseudorandom Permutation. ASIACRYPT 1991: 210-224 - [c27]Shimon Even, Ami Litman:
On the Capabilities of Systolic Systems (Extended Abstract). SPAA 1991: 357-367 - 1990
- [c26]Shimon Even:
Systolic Modular Multiplication. CRYPTO 1990: 619-624 - [c25]Shimon Even, Ami Litman, Peter Winkler:
Computing with Snakes in Directed Networks of Automata (Extended Abstract). FOCS 1990: 740-745 - [c24]Shimon Even, Yachin Pnueli:
How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions. Jerusalem Conference on Information Technology 1990: 414-425 - [c23]Shimon Even, Sergio Rajsbaum:
The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract). STOC 1990: 95-105
1980 – 1989
- 1989
- [c22]Shimon Even, Oded Goldreich
, Silvio Micali:
On-Line/Off-Line Digital Schemes. CRYPTO 1989: 263-275 - [c21]Shimon Even, Burkhard Monien:
On the Number of Rounds Necessary to Disseminate Information. SPAA 1989: 318-327 - 1985
- [j44]Shimon Even, Oded Goldreich
A Randomized Protocol for Signing Contracts. Commun. ACM 28(6): 637-647 (1985) - [j43]Shimon Even, Alan L. Selman, Yacov Yacobi:
Hard-Core Theorems for Complexity Classes. J. ACM 32(1): 205-217 (1985) - [j42]Shimon Even, Oded Goldreich
On the Power of Cascade Ciphers. ACM Trans. Comput. Syst. 3(2): 108-116 (1985) - [c20]Shimon Even, Oded Goldreich
On the Security of Ping-Pong Protocols when Implemented using the RSA. CRYPTO 1985: 58-72 - 1984
- [j41]Shimon Even, Azaria Paz:
A note on cake cutting. Discret. Appl. Math. 7(3): 285-296 (1984) - [j40]Shimon Even, Alan L. Selman, Yacov Yacobi:
The Complexity of Promise Problems with Applications to Public-Key Cryptography. Inf. Control. 61(2): 159-173 (1984) - [j39]Shimon Even, Oded Goldreich
On the np-completeness of certain network testing problems. Networks 14(1): 1-24 (1984) - [j38]Shimon Even, Oded Goldreich
Correction to 'DES-like functions can generate the alternating group' (Nov 83 863-865). IEEE Trans. Inf. Theory 30(5): 780- (1984) - [c19]Baruch Awerbuch, Shimon Even:
Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. PODC 1984: 278-281 - 1983
- [j37]Shimon Even:
A protocol for signing contracts. SIGACT News 15(1): 34-39 (1983) - [j36]Shimon Even, Oded Goldreich
DES-like functions can generate the alternating group. IEEE Trans. Inf. Theory 29(6): 863-865 (1983) - [c18]Shimon Even, Oded Goldreich:
On the Power of Cascade Ciphers. CRYPTO 1983: 43-50 - [c17]Shimon Even, Oded Goldreich:
Electronic Wallet. CRYPTO 1983: 383-386 - [c16]Shimon Even, Oded Goldreich:
On the Security of Multi-Party Ping-Pong Protocols. FOCS 1983: 34-39 - [c15]Reuven Bar-Yehuda, Shimon Even:
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem. WG 1983: 17-28 - 1982
- [j35]Danny Dolev
On the Security of Ping-Pong Protocols. Inf. Control. 55(1-3): 57-68 (1982) - [j34]Shimon Even, Timothy J. Long, Yacov Yacobi:
A Note on Deterministic and Nondeterministic Time Complexity. Inf. Control. 55(1-3): 117-124 (1982) - [c14]Danny Dolev, Shimon Even, Richard M. Karp:
On the Security of Ping-Pong Protocols. CRYPTO 1982: 177-186 - [c13]Shimon Even, Oded Goldreich, Abraham Lempel:
A Randomized Protocol for Signing Contracts. CRYPTO 1982: 205-210 - [c12]Shimon Even, Oded Goldreich:
On the Security of Multi-Party Ping-Pong Protocols. CRYPTO 1982: 315 - [c11]Reuven Bar-Yehuda, Shimon Even:
On Approximating a Vertex Cover for Planar Graphs. STOC 1982: 303-309 - 1981
- [j33]Shimon Even, Yossi Shiloach:
An On-Line Edge-Deletion Problem. J. ACM 28(1): 1-4 (1981) - [j32]Michael Rodeh, Vaughan R. Pratt, Shimon Even:
Linear Algorithm for Data Compression via String Matching. J. ACM 28(1): 16-24 (1981) - [j31]Reuven Bar-Yehuda, Shimon Even:
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem. J. Algorithms 2(2): 198-203 (1981) - [j30]Shimon Even, Oded Goldreich
The Minimum-Length Generator Sequence Problem is NP-Hard. J. Algorithms 2(3): 311-313 (1981) - [c10]Shimon Even:
Protocol for Signing Contracts. CRYPTO 1981: 148-153 - [c9]Shimon Even:
On Protocols for Cake Cutting. WG 1981: 183-194 - [e1]Shimon Even, Oded Kariv:
Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings. Lecture Notes in Computer Science 115, Springer 1981, ISBN 3-540-10843-2 [contents] - 1980
- [c8]Shimon Even, Yacov Yacobi:
Cryptocomplexity and NP-Completeness. ICALP 1980: 195-207 - [c7]Shimon Even, Yacov Yacobi:
An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography. WG 1980: 270-278
1970 – 1979
- 1978
- [j29]Shimon Even, Michael Rodeh:
Economical Encoding of Commas Between Strings. Commun. ACM 21(4): 315-317 (1978) - [c6]Shimon Even:
The Max Flow of Dinic and Karzanov: An Exposition. Jerusalem Conference on Information Technology 1978: 233-237 - 1977
- [j28]Shimon Even, Robert Endre Tarjan:
Corrigendum: Computing an st-Numbering. TCS 2(1976):339-344. Theor. Comput. Sci. 4(1): 123 (1977) - 1976
- [j27]Shimon Even, Robert Endre Tarjan:
A Combinatorial Problem Which Is Complete in Polynomial Space. J. ACM 23(4): 710-719 (1976) - [j26]Gideon Ehrlich, Shimon Even, Robert Endre Tarjan:
Intersection graphs of curves in the plane. J. Comb. Theory B 21(1): 8-20 (1976) - [j25]Shimon Even, Alon Itai, Adi Shamir:
On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5(4): 691-703 (1976) - [j24]Shimon Even, Robert Endre Tarjan:
Computing an st -Numbering. Theor. Comput. Sci. 2(3): 339-344 (1976) - 1975
- [j23]Yehoshua Perl, M. R. Garey, Shimon Even:
Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters. J. ACM 22(2): 202-214 (1975) - [j22]Shimon Even:
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k. SIAM J. Comput. 4(3): 393-396 (1975) - [j21]Shimon Even, Robert Endre Tarjan:
Network Flow and Testing Graph Connectivity. SIAM J. Comput. 4(4): 507-518 (1975) - [c5]Shimon Even, Oded Kariv:
An O(n^2.5) Algorithm for Maximum Matching in General Graphs. FOCS 1975: 100-112 - [c4]Shimon Even, Alon Itai, Adi Shamir:
On the Complexity of Timetable and Multi-Commodity Flow Problems. FOCS 1975: 184-193 - [c3]Shimon Even, Robert Endre Tarjan:
a Combinatorial Problem which is Complete in Polynomial Space. STOC 1975: 66-71 - 1974
- [j20]Shimon Even:
Parallelism in Tape-Sorting. Commun. ACM 17(4): 202-204 (1974) - 1973
- [j19]Abraham Lempel, Shimon Even, Martin Cohn:
An algorithm for optimal prefix parsing of a noiseless and memoryless channel. IEEE Trans. Inf. Theory 19(2): 208-214 (1973) - 1972
- [j18]Shimon Even, Abraham Lempel:
Generation and Enumeration of All Solutions of the Characteristic Sum Condition. Inf. Control. 21(5): 476-482 (1972) - [j17]Shimon Even, Amir Pnueli, Abraham Lempel:
Permutation Graphs and Transitive Graphs. J. ACM 19(3): 400-410 (1972) - 1971
- [j16]Frederic G. Commoner, Anatol W. Holt, Shimon Even, Amir Pnueli:
Marked Directed Graphs. J. Comput. Syst. Sci. 5(5): 511-523 (1971) - [j15]Ronald Vernon Book, Shimon Even, Sheila A. Greibach, Gene Ott:
Ambiguity in Graphs and Expressions. IEEE Trans. Computers 20(2): 149-153 (1971) - 1970
- [j14]Francesco Brioschi, Shimon Even:
Minimizing the Number of Operations in Certain Discrete-Variable Optimization Problems. Oper. Res. 18(1): 66-81 (1970)
1960 – 1969
- 1969
- [j13]Shimon Even, Albert R. Meyer
Sequential Boolean Equations. IEEE Trans. Computers 18(3): 230-240 (1969) - [j12]Martin Cohn, Shimon Even:
The Design of Shift Register Generators for Finite Sequences. IEEE Trans. Computers 18(7): 660-662 (1969) - [j11]Martin Cohn, Shimon Even:
A Gray Code Counter. IEEE Trans. Computers 18(7): 662-664 (1969) - 1967
- [j10]Shimon Even, Igal Kohavi, Azaria Paz:
On Minimal Modulo 2 Sums of Products for Switching Functions. IEEE Trans. Electron. Comput. 16(5): 671-674 (1967) - 1966
- [j9]Shimon Even, Albert R. Meyer
Test for Planarity of a Circuit Given by an Expression. IEEE Trans. Electron. Comput. 15(3): 372-375 (1966) - [j8]Willard L. Eastman, Shimon Even:
Some further results on synchronizable block codes (Corresp.). IEEE Trans. Inf. Theory 12(3): 404-406 (1966) - [c2]Shimon Even, Igal Kohavi, Azaria Paz:
On Minimal Modulo 2 Sums of Products for Switching Functions. SWAT 1966: 201-206 - 1965
- [j7]Martin Cohn, Shimon Even:
Identification and Minimization of Linear Machines. IEEE Trans. Electron. Comput. 14(3): 367-376 (1965) - [j6]Shimon Even:
On Information Lossless Automata of Finite Order. IEEE Trans. Electron. Comput. 14(4): 561-569 (1965) - [j5]Shimon Even:
Comments on the Minimization of Stochastic Machines. IEEE Trans. Electron. Comput. 14(4): 634-637 (1965) - 1964
- [j4]Shimon Even:
Rational Numbers and Regular Events. IEEE Trans. Electron. Comput. 13(6): 740-741 (1964) - [j3]Shimon Even:
Test for synchronizability of finite automata and variable length codes. IEEE Trans. Inf. Theory 10(3): 185-189 (1964) - [j2]Willard L. Eastman, Shimon Even:
On synchronizable and PSK-synchronizable block codes. IEEE Trans. Inf. Theory 10(4): 351-356 (1964) - 1963
- [j1]Shimon Even:
Tests for unique decipherability. IEEE Trans. Inf. Theory 9(2): 109-112 (1963) - 1962
- [c1]Shimon Even:
Generalized automata and their information losslessness. SWCT 1962: 143-147
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: