| Layout of an Arbitrary Permutation in a Minimal Right Triangle Area. | 0 | 0.34 | 2007 |
| Layout Of An Arbitrary Permutation In A Minimal Right Triangle Area | 0 | 0.34 | 2005 |
| Layout Area of the Hypercube | 4 | 0.55 | 2003 |
| A Compact Layout of the Butterfly | 4 | 0.72 | 2003 |
| Layout area of the hypercube: (extended abstract) | 0 | 0.34 | 2002 |
| Laying Out the Interconnection Network of the Transpose Bijection | 0 | 0.34 | 2002 |
| Area efficient layouts of the Batcher sorting networks | 4 | 0.78 | 2001 |
| Embedding Interconnection Networks in Grids via the Layered Cross Product | 1 | 0.37 | 2000 |
| Some compact layouts of the butterfly | 8 | 0.59 | 1999 |
| On mixed connectivity certificates | 7 | 0.75 | 1998 |
| Layout of the batcher bitonic sorter (extended abstract) | 5 | 0.51 | 1998 |
| A Tight Layout of the Butterfly Network | 17 | 0.96 | 1998 |
| A Note on Limited Preemption | 0 | 0.34 | 1998 |
| Monochromatic Paths and Triangulated Graphs | 0 | 0.34 | 1998 |
| Computing with snakes in directed networks of automata | 19 | 1.78 | 1997 |
| The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks. | 18 | 2.69 | 1997 |
| On-line/off-line digital signatures | 194 | 53.00 | 1996 |
| Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer | 9 | 1.06 | 1995 |
| On Mixed Connectivity Certificates (Extended Abstract) | 0 | 0.34 | 1995 |
| On the capabilities of systolic systems | 9 | 1.00 | 1994 |
| A unified scheme for routing in expander based networks | 0 | 0.34 | 1994 |
| Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection | 9 | 0.99 | 1994 |
| Layered cross product—a technique to construct interconnection networks | 15 | 1.19 | 1992 |
| A construction of a cipher from a single pseudorandom permutation | 154 | 11.67 | 1991 |
| On the capabilities of systolic systems (extended abstract) | 2 | 0.66 | 1991 |
| The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract) | 0 | 0.34 | 1990 |
| Computing with Snakes in Directed Networks of Automata (Extended Abstract) | 0 | 0.34 | 1990 |
| Systolic Modular Multiplication | 13 | 7.64 | 1990 |
| On-Line/Off-Line Digital Schemes | 31 | 1.66 | 1989 |
| On the security of ping-pong protocols when implemented using the RSA | 16 | 7.35 | 1985 |
| Hard-core theorems for complexity classes | 17 | 4.12 | 1985 |
| On the power of cascade ciphers | 32 | 5.65 | 1985 |
| The complexity of promise problems with applications to public-key cryptography | 132 | 13.30 | 1984 |
| Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network | 30 | 38.88 | 1984 |
| Electronic Wallet | 7 | 2.95 | 1983 |
| On the security of multi-party ping-pong protocols | 68 | 10.37 | 1983 |
| A Note on Deterministic and Nondeterministic Time Complexity | 3 | 0.91 | 1982 |
| A randomized protocol for signing contracts | 519 | 155.13 | 1982 |
| On the Security of Ping-Pong Protocols | 48 | 10.09 | 1982 |
| Protocol for Signing Contracts | 8 | 9.17 | 1981 |
| An On-Line Edge-Deletion Problem | 124 | 19.08 | 1981 |
| Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings | 44 | 107.39 | 1981 |
| A linear-time approximation algorithm for the weighted vertex cover problem | 182 | 38.27 | 1981 |
| The minimum-length generator sequence problem is NP-hard | 37 | 22.09 | 1981 |
| Linear Algorithm for Data Compression via String Matching | 106 | 37.91 | 1981 |
| On Protocols for Cake Cutting. | 0 | 0.34 | 1981 |
| Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version) | 2 | 1.73 | 1981 |
| Cryptocomplexity and NP-Completeness | 21 | 14.60 | 1980 |
| An Observation Concerning the Complexity of Problems with Few Solutions and its Application to Cryptography | 0 | 0.34 | 1980 |
| The Max Flow of Dinic and Karzanov: An Exposition | 0 | 0.34 | 1978 |
