2009 |
143 | EE | Itai Dinur,
Adi Shamir:
Cube Attacks on Tweakable Black Box Polynomials.
EUROCRYPT 2009: 278-299 |
142 | EE | Shlomi Dolev,
Marina Kopeetsky,
Adi Shamir:
RFID Authentication, Efficient Proactive Information Security within Computational Security
CoRR abs/0903.5177: (2009) |
2008 |
141 | EE | Naofumi Homma,
Atsushi Miyamoto,
Takafumi Aoki,
Akashi Satoh,
Adi Shamir:
Collision-Based Power Analysis of Modular Exponentiation Using Chosen-Message Pairs.
CHES 2008: 15-29 |
140 | EE | Adi Shamir:
RSA-Past, Present, Future.
CHES 2008: 443 |
139 | EE | Eli Biham,
Yaniv Carmeli,
Adi Shamir:
Bug Attacks.
CRYPTO 2008: 221-240 |
138 | EE | Elena Andreeva,
Charles Bouillaguet,
Pierre-Alain Fouque,
Jonathan J. Hoch,
John Kelsey,
Adi Shamir,
Sébastien Zimmer:
Second Preimage Attacks on Dithered Hash Functions.
EUROCRYPT 2008: 270-288 |
137 | EE | Adi Shamir:
SQUASH - A New MAC with Provable Security Properties for Highly Constrained Devices Such as RFID Tags.
FSE 2008: 144-157 |
136 | EE | Jonathan J. Hoch,
Adi Shamir:
On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak.
ICALP (2) 2008: 616-630 |
135 | EE | Raphael Chung-Wei Phan,
Adi Shamir:
Improved Related-key Attacks on Desx and Desx+.
Cryptologia 32(1): 13-22 (2008) |
2007 |
134 | EE | Vivien Dubois,
Pierre-Alain Fouque,
Adi Shamir,
Jacques Stern:
Practical Cryptanalysis of SFLASH.
CRYPTO 2007: 1-12 |
133 | EE | Vivien Dubois,
Pierre-Alain Fouque,
Adi Shamir,
Jacques Stern:
Cryptanalysis of the SFLASH Signature Scheme.
Inscrypt 2007: 1-4 |
132 | EE | Dima Ruinskiy,
Adi Shamir,
Boaz Tsaban:
Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions.
Public Key Cryptography 2007: 61-75 |
131 | EE | Dima Ruinskiy,
Adi Shamir,
Boaz Tsaban:
Cryptanalysis of group-based key agreement protocols using subgroup distance functions
CoRR abs/0705.2862: (2007) |
130 | EE | Yossef Oren,
Adi Shamir:
Remote Password Extraction from RFID Tags.
IEEE Trans. Computers 56(9): 1292-1296 (2007) |
2006 |
129 | EE | Elad Barkan,
Eli Biham,
Adi Shamir:
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs.
CRYPTO 2006: 1-21 |
128 | EE | Dag Arne Osvik,
Adi Shamir,
Eran Tromer:
Cache Attacks and Countermeasures: The Case of AES.
CT-RSA 2006: 1-20 |
127 | EE | Ronald L. Rivest,
Adi Shamir,
Yael Tauman:
How to Leak a Secret: Theory and Applications of Ring Signatures.
Essays in Memory of Shimon Even 2006: 164-186 |
126 | EE | Jonathan J. Hoch,
Adi Shamir:
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions.
FSE 2006: 179-194 |
125 | EE | Dima Ruinskiy,
Adi Shamir,
Boaz Tsaban:
Length-based cryptanalysis: The case of Thompson's Group
CoRR abs/cs/0607079: (2006) |
2005 |
124 | EE | Willi Geiselmann,
Adi Shamir,
Rainer Steinwandt,
Eran Tromer:
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization.
CHES 2005: 131-146 |
123 | EE | Alexander Klimov,
Adi Shamir:
New Applications of T-Functions in Block Ciphers and Hash Functions.
FSE 2005: 18-31 |
122 | EE | Alex Biryukov,
Adi Shamir:
Analysis of the Non-linear Part of Mugi.
FSE 2005: 320-329 |
121 | EE | Adi Shamir,
Eran Tromer:
TWIRL.
Encyclopedia of Cryptography and Security 2005 |
120 | EE | Eli Biham,
Alex Biryukov,
Adi Shamir:
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials.
J. Cryptology 18(4): 291-311 (2005) |
2004 |
119 | EE | Adi Shamir:
Stream Ciphers: Dead or Alive?
ASIACRYPT 2004: 78 |
118 | EE | Jonathan J. Hoch,
Adi Shamir:
Fault Analysis of Stream Ciphers.
CHES 2004: 240-253 |
117 | EE | Alexander Klimov,
Adi Shamir:
New Cryptographic Primitives Based on Multiword T-Functions.
FSE 2004: 1-15 |
2003 |
116 | EE | Arjen K. Lenstra,
Eran Tromer,
Adi Shamir,
Wil Kortsmit,
Bruce Dodson,
James Hughes,
Paul C. Leyland:
Factoring Estimates for a 1024-Bit RSA Modulus.
ASIACRYPT 2003: 55-74 |
115 | EE | Adi Shamir,
Eran Tromer:
Factoring Large Number with the TWIRL Device.
CRYPTO 2003: 1-26 |
114 | EE | Adi Shamir:
RSA Shortcuts.
CT-RSA 2003: 327 |
113 | EE | Alexander Klimov,
Adi Shamir:
Cryptographic Applications of T-Functions.
Selected Areas in Cryptography 2003: 248-261 |
2002 |
112 | EE | Arjen K. Lenstra,
Adi Shamir,
Jim Tomlinson,
Eran Tromer:
Analysis of Bernstein's Factorization Circuit.
ASIACRYPT 2002: 1-26 |
111 | EE | Alexander Klimov,
Anton Mityagin,
Adi Shamir:
Analysis of Neural Cryptography.
ASIACRYPT 2002: 288-298 |
110 | EE | Alexander Klimov,
Adi Shamir:
A New Class of Invertible Mappings.
CHES 2002: 470-483 |
109 | EE | Dani Halevy,
Adi Shamir:
The LSD Broadcast Encryption Scheme.
CRYPTO 2002: 47-60 |
2001 |
108 | EE | Ronald L. Rivest,
Adi Shamir,
Yael Tauman:
How to Leak a Secret.
ASIACRYPT 2001: 552-565 |
107 | EE | Adi Shamir:
New Directions in Croptography.
CHES 2001: 159 |
106 | EE | Adi Shamir,
Yael Tauman:
Improved Online/Offline Signature Schemes.
CRYPTO 2001: 355-367 |
105 | EE | Alex Biryukov,
Adi Shamir:
Structural Cryptanalysis of SASAS.
EUROCRYPT 2001: 394-405 |
104 | EE | Itsik Mantin,
Adi Shamir:
A Practical Attack on Broadcast RC4.
FSE 2001: 152-164 |
103 | EE | Adi Shamir:
SecureClick: A Web Payment System with Disposable Credit Card Numbers.
Financial Cryptography 2001: 223-233 |
102 | EE | Scott R. Fluhrer,
Itsik Mantin,
Adi Shamir:
Weaknesses in the Key Scheduling Algorithm of RC4.
Selected Areas in Cryptography 2001: 1-24 |
101 | EE | Adi Shamir,
Boaz Tsaban:
Guaranteeing the diversity of number generators
CoRR cs.CR/0112014: (2001) |
100 | EE | Adi Shamir,
Boaz Tsaban:
Guaranteeing the Diversity of Number Generators.
Inf. Comput. 171(2): 350-363 (2001) |
2000 |
99 | EE | Alex Biryukov,
Adi Shamir:
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers.
ASIACRYPT 2000: 1-13 |
98 | EE | Adi Shamir:
Protecting Smart Cards from Passive Power Analysis with Detached Power Supplies.
CHES 2000: 71-77 |
97 | EE | Arjen K. Lenstra,
Adi Shamir:
Analysis and Optimization of the TWINKLE Factoring Device.
EUROCRYPT 2000: 35-52 |
96 | EE | Nicolas Courtois,
Alexander Klimov,
Jacques Patarin,
Adi Shamir:
Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations.
EUROCRYPT 2000: 392-407 |
95 | EE | Alex Biryukov,
Adi Shamir,
David Wagner:
Real Time Cryptanalysis of A5/1 on a PC.
FSE 2000: 1-18 |
1999 |
94 | EE | Adi Shamir:
Factoring Large Numbers with the Twinkle Device (Extended Abstract).
CHES 1999: 2-12 |
93 | EE | Aviad Kipnis,
Adi Shamir:
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization.
CRYPTO 1999: 19-30 |
92 | EE | Eli Biham,
Alex Biryukov,
Adi Shamir:
Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials.
EUROCRYPT 1999: 12-23 |
91 | EE | Eli Biham,
Alex Biryukov,
Adi Shamir:
Miss in the Middle Attacks on IDEA and Khufu.
FSE 1999: 124-138 |
90 | EE | Adi Shamir,
Nicko van Someren:
Playing "Hide and Seek" with Stored Keys.
Financial Cryptography 1999: 118-124 |
89 | EE | David Naccache,
Adi Shamir,
Julien P. Stern:
How to Copyright a Function?
Public Key Cryptography 1999: 188-196 |
88 | | Uriel Feige,
Dror Lapidot,
Adi Shamir:
Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions.
SIAM J. Comput. 29(1): 1-28 (1999) |
1998 |
87 | EE | Aviad Kipnis,
Adi Shamir:
Cryptanalysis of the Oil & Vinegar Signature Scheme.
CRYPTO 1998: 257-266 |
86 | EE | Adi Shamir:
Visual Cryptanalysis.
EUROCRYPT 1998: 201-210 |
85 | EE | Ross J. Anderson,
Roger M. Needham,
Adi Shamir:
The Steganographic File System.
Information Hiding 1998: 73-82 |
84 | EE | Eli Biham,
Alex Biryukov,
Orr Dunkelman,
Eran Richardson,
Adi Shamir:
Initial Observations on Skipjack: Cryptanalysis of Skipjack-3XOR.
Selected Areas in Cryptography 1998: 362-376 |
1997 |
83 | EE | Eli Biham,
Adi Shamir:
Differential Fault Analysis of Secret Key Cryptosystems.
CRYPTO 1997: 513-525 |
82 | EE | Don Coppersmith,
Adi Shamir:
Lattice Attacks on NTRU.
EUROCRYPT 1997: 52-61 |
81 | | Dror Lapidot,
Adi Shamir:
Fully Parallelized Multi-Prover Protocols for NEXP-Time.
J. Comput. Syst. Sci. 54(2): 215-220 (1997) |
1996 |
80 | | Moni Naor,
Adi Shamir:
Visual Cryptography II: Improving the Contrast Via the Cover Base.
Security Protocols Workshop 1996: 197-202 |
79 | | Ronald L. Rivest,
Adi Shamir:
PayWord and MicroMint: Two Simple Micropayment Schemes.
Security Protocols Workshop 1996: 69-87 |
1995 |
78 | | Dror Lapidot,
Adi Shamir:
A One-Round, Two-Prover, Zero-Knowledge Protocol for NP.
Combinatorica 15(2): 204-214 (1995) |
1994 |
77 | EE | Moni Naor,
Adi Shamir:
Visual Cryptography.
EUROCRYPT 1994: 1-12 |
76 | EE | Adi Shamir:
Memory Efficient Variants of Public-Key Schemes for Smart Card Applications.
EUROCRYPT 1994: 445-449 |
1993 |
75 | EE | Adi Shamir:
Efficient Signature Schemes Based on Birational Permutations.
CRYPTO 1993: 1-12 |
74 | | Adi Shamir:
Practical Cryptography - Recent Trends and Results.
ISTCS 1993: 127 |
73 | EE | Adi Shamir:
On the generation of multivariate polynomials which are hard to factor.
STOC 1993: 796-804 |
72 | | David Feldman,
Russell Impagliazzo,
Moni Naor,
Noam Nisan,
Steven Rudich,
Adi Shamir:
On Dice and Coins: Models of Computation for Random Generation
Inf. Comput. 104(2): 159-174 (1993) |
71 | | Johan Håstad,
A. W. Schrift,
Adi Shamir:
The Discrete Logarithm Modulo a Composite Hides O(n) Bits.
J. Comput. Syst. Sci. 47(3): 376-404 (1993) |
70 | | A. W. Schrift,
Adi Shamir:
Universal Tests for Nonuniform Distributions.
J. Cryptology 6(3): 119-133 (1993) |
1992 |
69 | EE | Eli Biham,
Adi Shamir:
Differential Cryptanalysis of the Full 16-Round DES.
CRYPTO 1992: 487-496 |
68 | EE | Adi Shamir:
IP = PSPACE.
J. ACM 39(4): 869-877 (1992) |
67 | | Uriel Feige,
Adi Shamir:
Multi-Oracle Interactive Protocols with Constant Space Verifiers.
J. Comput. Syst. Sci. 44(2): 259-271 (1992) |
1991 |
66 | EE | Eli Biham,
Adi Shamir:
Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer.
CRYPTO 1991: 156-171 |
65 | EE | Dror Lapidot,
Adi Shamir:
A One-Round, Two-Prover, Zero-Knowledge Protocol for NP.
CRYPTO 1991: 213-224 |
64 | EE | Eli Biham,
Adi Shamir:
Differential Cryptoanalysis of Feal and N-Hash.
EUROCRYPT 1991: 1-16 |
63 | | Dror Lapidot,
Adi Shamir:
Fully Parallelized Multi Prover Protocols for NEXP-Time (Extended Abstract)
FOCS 1991: 13-18 |
62 | | Eli Biham,
Adi Shamir:
Differential Cryptanalysis of DES-like Cryptosystems.
J. Cryptology 4(1): 3-72 (1991) |
1990 |
61 | EE | Eli Biham,
Adi Shamir:
Differential Cryptanalysis of DES-like Cryptosystems.
CRYPTO 1990: 2-21 |
60 | EE | Dror Lapidot,
Adi Shamir:
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs.
CRYPTO 1990: 353-365 |
59 | | Adi Shamir:
IP=PSPACE
FOCS 1990: 11-15 |
58 | | Uriel Feige,
Dror Lapidot,
Adi Shamir:
Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract)
FOCS 1990: 308-317 |
57 | | A. W. Schrift,
Adi Shamir:
The Discrete Log is Very Discreet
STOC 1990: 405-415 |
56 | | Uriel Feige,
Adi Shamir:
Witness Indistinguishable and Witness Hiding Protocols
STOC 1990: 416-426 |
1989 |
55 | EE | Uriel Feige,
Adi Shamir:
Zero Knowledge Proofs of Knowledge in Two Rounds.
CRYPTO 1989: 526-544 |
54 | EE | Adi Shamir:
An Efficient Identification Scheme Based on Permuted Kernels (Extended Abstract).
CRYPTO 1989: 606-609 |
53 | | Amos Fiat,
Shahar Moses,
Adi Shamir,
Ilan Shimshoni,
Gábor Tardos:
Planning and Learning in Permutation Groups
FOCS 1989: 274-279 |
52 | | David Feldman,
Russell Impagliazzo,
Moni Naor,
Noam Nisan,
Steven Rudich,
Adi Shamir:
On Dice and Coins: Models of Computation for Random Generation.
ICALP 1989: 319-340 |
51 | | Uriel Feige,
Adi Shamir:
Multi-Oracle Interactive Protocols with Space Bounded Verifiers.
Structure in Complexity Theory Conference 1989: 158-164 |
1988 |
50 | EE | Silvio Micali,
Adi Shamir:
An Improvement of the Fiat-Shamir Identification and Signature Scheme.
CRYPTO 1988: 244-247 |
49 | EE | Uriel Feige,
Adi Shamir,
Moshe Tennenholtz:
The Noisy Oracle Problem.
CRYPTO 1988: 284-296 |
48 | | Uriel Feige,
Amos Fiat,
Adi Shamir:
Zero-Knowledge Proofs of Identity.
J. Cryptology 1(2): 77-94 (1988) |
47 | | Alan M. Frieze,
Johan Håstad,
Ravi Kannan,
J. C. Lagarias,
Adi Shamir:
Reconstructing Truncated Integer Variables Satisfying Linear Congruences.
SIAM J. Comput. 17(2): 262-280 (1988) |
1987 |
46 | EE | Yossi Matias,
Adi Shamir:
A Video Scrambling Technique Based On Space Filling Curves.
CRYPTO 1987: 398-417 |
45 | | Uriel Feige,
Amos Fiat,
Adi Shamir:
Zero Knowledge Proofs of Identity
STOC 1987: 210-217 |
1986 |
44 | EE | Amos Fiat,
Adi Shamir:
How to Prove Yourself: Practical Solutions to Identification and Signature Problems.
CRYPTO 1986: 186-194 |
43 | | Sandeep Sen,
Isaac D. Scherson,
Adi Shamir:
Shear Sort: A True Two-Dimensional Sorting Techniques for VLSI Networks.
ICPP 1986: 903-908 |
42 | | Claus-Peter Schnorr,
Adi Shamir:
An Optimal Sorting Algorithm for Mesh Connected Computers
STOC 1986: 255-263 |
41 | | Amos Fiat,
Adi Shamir:
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers.
J. Comput. Syst. Sci. 33(1): 47-65 (1986) |
1985 |
40 | EE | Adi Shamir:
On the Security of DES.
CRYPTO 1985: 280-281 |
39 | EE | Shimon Even,
Oded Goldreich,
Adi Shamir:
On the Security of Ping-Pong Protocols when Implemented using the RSA.
CRYPTO 1985: 58-72 |
38 | EE | Ronald L. Rivest,
Adi Shamir:
Efficient Factoring Based on Partial Information.
EUROCRYPT 1985: 31-34 |
37 | | Amos Fiat,
Adi Shamir,
Ehud Y. Shapiro:
Polymorphic Arrays: An Architecture for a Programmable Systolic Machine.
ICPP 1985: 112-117 |
36 | | Johan Håstad,
Adi Shamir:
The Cryptographic Security of Truncated Linearly Related Variables
STOC 1985: 356-362 |
35 | | Jeffrey Shallit,
Adi Shamir:
Number-Theoretic Functions Which Are Equivalent to Number of Divisors.
Inf. Process. Lett. 20(3): 151-153 (1985) |
1984 |
34 | EE | H. Ong,
Claus-Peter Schnorr,
Adi Shamir:
Efficient Signature Schemes Based on Polynomial Equations.
CRYPTO 1984: 37-46 |
33 | EE | Adi Shamir:
Identity-Based Cryptosystems and Signature Schemes.
CRYPTO 1984: 47-53 |
32 | | Amos Fiat,
Adi Shamir:
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers
FOCS 1984: 37-45 |
31 | | H. Ong,
Claus-Peter Schnorr,
Adi Shamir:
An Efficient Signature Scheme Based on Quadratic Equations
STOC 1984: 208-216 |
30 | | Ronald L. Rivest,
Adi Shamir:
How to Expose an Eavesdropper.
Commun. ACM 27(4): 393-395 (1984) |
29 | | Amos Fiat,
Adi Shamir:
Generalized 'write-once' memories.
IEEE Transactions on Information Theory 30(3): 470-479 (1984) |
28 | | Adi Shamir:
A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem.
IEEE Transactions on Information Theory 30(5): 699-704 (1984) |
27 | | Adi Shamir,
Claus-Peter Schnorr:
Cryptanalysis of Certain Variants of Rabin's Signature Scheme.
Inf. Process. Lett. 19(3): 113-115 (1984) |
1983 |
26 | | Michael Ben-Or,
Benny Chor,
Adi Shamir:
On the Cryptographic Security of Single RSA Bits
STOC 1983: 421-430 |
25 | EE | Adi Shamir:
On the Generation of Cryptographically Strong Pseudorandom Sequences
ACM Trans. Comput. Syst. 1(1): 38-44 (1983) |
24 | | Ronald L. Rivest,
Adi Shamir,
Leonard M. Adleman:
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems (Reprint).
Commun. ACM 26(1): 96-99 (1983) |
23 | | Adi Shamir:
Embedding Cryptographic Trapdoors in Arbitrary Knapsack Systems.
Inf. Process. Lett. 17(2): 77-79 (1983) |
1982 |
22 | | Adi Shamir:
A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem.
CRYPTO 1982: 279-288 |
21 | | Adi Shamir:
A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem
FOCS 1982: 145-152 |
20 | | Ronald L. Rivest,
Adi Shamir:
How to Reuse a ``Write-Once'' Memory (Preliminary Version)
STOC 1982: 105-113 |
19 | | Ronald L. Rivest,
Adi Shamir:
How to Reuse a ``Write-Once'' Memory
Information and Control 55(1-3): 1-19 (1982) |
1981 |
18 | | Adi Shamir:
The Generation of Cryptographically Strong Pseudo-Random Sequences.
CRYPTO 1981: 1 |
17 | | Adi Shamir:
On the Generation of Cryptographically Strong Pseudo-Random Sequences.
ICALP 1981: 544-550 |
16 | | Richard Schroeppel,
Adi Shamir:
A T=O(2^(n/2)), S=O(2^(n/4)) Algorithm for Certain NP-Complete Problems.
SIAM J. Comput. 10(3): 456-464 (1981) |
1980 |
15 | | Adi Shamir:
On the Power of Commutativity in Cryptography.
ICALP 1980: 582-595 |
14 | | Adi Shamir:
The Cryptographic Security of Compact Knapsacks (Preliminary Report).
IEEE Symposium on Security and Privacy 1980: 94-99 |
1979 |
13 | | Richard Schroeppel,
Adi Shamir:
A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems
FOCS 1979: 328-336 |
12 | | Adi Shamir:
On the Cryptocomplexity of Knapsack Systems
STOC 1979: 118-129 |
11 | | Adi Shamir:
How to Share a Secret.
Commun. ACM 22(11): 612-613 (1979) |
10 | | Adi Shamir:
Factoring Numbers in O(log n) Arithmetic Steps.
Inf. Process. Lett. 8(1): 28-31 (1979) |
9 | | Adi Shamir:
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs.
SIAM J. Comput. 8(4): 645-655 (1979) |
1978 |
8 | | Ronald L. Rivest,
Adi Shamir,
Leonard M. Adleman:
A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.
Commun. ACM 21(2): 120-126 (1978) |
7 | | Zohar Manna,
Adi Shamir:
The Convergence of Functions to Fixedpoints of Recursive Definitions.
Theor. Comput. Sci. 6: 109-141 (1978) |
1977 |
6 | | Adi Shamir,
William W. Wadge:
Data Types as Objects.
ICALP 1977: 465-479 |
5 | | Zohar Manna,
Adi Shamir:
The Optimal Approach to Recursive Programs.
Commun. ACM 20(11): 824-831 (1977) |
1976 |
4 | | Zohar Manna,
Adi Shamir:
The Theoretical Aspects of the Optimal Fixed Point.
SIAM J. Comput. 5(3): 414-426 (1976) |
3 | | Shimon Even,
Alon Itai,
Adi Shamir:
On the Complexity of Timetable and Multicommodity Flow Problems.
SIAM J. Comput. 5(4): 691-703 (1976) |
1975 |
2 | | Shimon Even,
Alon Itai,
Adi Shamir:
On the Complexity of Timetable and Multi-Commodity Flow Problems
FOCS 1975: 184-193 |
1 | | Zohar Manna,
Adi Shamir:
The Optimal Fixedpoint of Recursive Programs
STOC 1975: 194-206 |