| Year |
Citation |
Score |
| 2007 |
Artishchev-Zapolotsky M, Dinitz Y, Even S, Yanovsky V. Layout Of An Arbitrary Permutation In A Minimal Right Triangle Area Journal of Interconnection Networks. 8: 101-118. DOI: 10.1142/S0219265907001928 |
0.342 |
|
| 2001 |
Even S. Area efficient layouts of the Batcher sorting networks Networks. 38: 199-208. DOI: 10.1002/Net.10003 |
0.329 |
|
| 1998 |
Avior A, Calamoneri T, Even S, Litman A, Rosenberg AL. A tight layout of the butterfly network Theory of Computing Systems \/ Mathematical Systems Theory. 31: 475-488. DOI: 10.1007/S002240000098 |
0.303 |
|
| 1997 |
Even S, Litman A, Winkler P. Computing with Snakes in Directed Networks of Automata Journal of Algorithms. 24: 158-170. DOI: 10.1006/Jagm.1996.0840 |
0.352 |
|
| 1996 |
Even S, Goldreich O, Micali S. On-line/off-line digital signatures Journal of Cryptology. 9: 35-67. DOI: 10.1007/Bf02254791 |
0.541 |
|
| 1985 |
Even S, Goldreich O, Lempel A. A randomized protocol for signing contracts Communications of the Acm. 28: 637-647. DOI: 10.1145/3812.3818 |
0.538 |
|
| 1985 |
Even S, Goldreich O. On the power of cascade ciphers Acm Transactions On Computer Systems. 3: 108-116. DOI: 10.1145/214438.214442 |
0.567 |
|
| 1984 |
Even S, Selman AL, Yacobi Y. The complexity of promise problems with applications to public-key cryptography Information and Control. 61: 159-173. DOI: 10.1016/S0019-9958(84)80056-X |
0.335 |
|
| 1984 |
Even S, Paz A. A note on cake cutting Discrete Applied Mathematics. 7: 285-296. DOI: 10.1016/0166-218X(84)90005-2 |
0.308 |
|
| 1984 |
Even S, Goldreich O, Moran S, Tong P. On the np‐completeness of certain network testing problems Networks. 14: 1-24. DOI: 10.1002/Net.3230140102 |
0.598 |
|
| 1983 |
Even S, Goldreich O. DES-like functions can generate the alternating group Ieee Transactions On Information Theory. 29: 863-865. DOI: 10.1109/Tit.1983.1056752 |
0.552 |
|
| 1981 |
Shiloach Y, Even S. An On-Line Edge-Deletion Problem Journal of the Acm. 28: 1-4. DOI: 10.1145/322234.322235 |
0.326 |
|
| 1981 |
Even S, Goldreich O. The minimum-length generator sequence problem is NP-hard Journal of Algorithms. 2: 311-313. DOI: 10.1016/0196-6774(81)90029-8 |
0.575 |
|
| 1976 |
Even S, Tarjan RE. A Combinatorial Problem Which Is Complete in Polynomial Space Journal of the Acm (Jacm). 23: 710-719. DOI: 10.1145/321978.321989 |
0.307 |
|
| 1976 |
Even S, Itai A, Shamir A. On the Complexity of Timetable and Multicommodity Flow Problems Siam Journal On Computing. 5: 691-703. DOI: 10.1137/0205048 |
0.579 |
|
| 1976 |
Even S, Tarjan RE. Computing an st-numbering Theoretical Computer Science. 2: 339-344. DOI: 10.1016/0304-3975(76)90086-4 |
0.338 |
|
| 1976 |
Ehrlich G, Even S, Tarjan RE. Intersection graphs of curves in the plane Journal of Combinatorial Theory, Series B. 21: 8-20. DOI: 10.1016/0095-8956(76)90022-8 |
0.331 |
|
| 1975 |
Perl Y, Garey MR, Even S. Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters Journal of the Acm (Jacm). 22: 202-214. DOI: 10.1145/321879.321883 |
0.305 |
|
| 1975 |
Even S, Tarjan RE. Network Flow and Testing Graph Connectivity Siam Journal On Computing. 4: 507-518. DOI: 10.1137/0204043 |
0.312 |
|
| 1973 |
Even S. An Algorithm for Determining Whether the Connectivity of a Graph is at Least k Siam Journal On Computing. 4: 393-396. DOI: 10.1137/0204034 |
0.334 |
|
| 1972 |
Even S, Pnueli A, Lempel A. Permutation Graphs and Transitive Graphs Journal of the Acm (Jacm). 19: 400-410. DOI: 10.1145/321707.321710 |
0.338 |
|
| 1971 |
Commoner F, Holt AW, Even S, Pnueli A. Marked directed graphs Journal of Computer and System Sciences. 5: 511-523. DOI: 10.1016/S0022-0000(71)80013-2 |
0.334 |
|
| 1969 |
Even S, Meyer AR. Sequential Boolean Equations Ieee Transactions On Computers. 18: 230-240. DOI: 10.1109/T-C.1969.222636 |
0.318 |
|
| 1964 |
Eastman WL, Even S, Isaacs IM. Bounds for the Optimal Scheduling of n Jobs on m Processors Management Science. 11: 268-279. DOI: 10.1287/Mnsc.11.2.268 |
0.311 |
|
| 1964 |
Even S. Test for synchronizability of finite automata and variable length codes Ieee Transactions On Information Theory. 10: 185-189. DOI: 10.1109/Tit.1964.1053683 |
0.307 |
|
| Show low-probability matches. |