Select / remove query terms:
Found 5668 results in 0.003 sec. (Time to generate facets: 0 sec.)
: An Attack on the Needham-Schroeder Public-Key Authentication Protocol.
Inf. Process. Lett.
(IPL)
56(3):131-133 (1995)
: A Lower Bound for the Time to Assure Interactive Consistency.
Inf. Process. Lett.
(IPL)
14(4):183-186 (1982)
: Approximation Algorithms for Geometric Median Problems.
Inf. Process. Lett.
(IPL)
44(5):245-249 (1992)
: Private vs. Common Random Bits in Communication Complexity.
Inf. Process. Lett.
(IPL)
39(2):67-71 (1991)
: A clustering algorithm based on graph connectivity.
Inf. Process. Lett.
(IPL)
76(4-6):175-181 (2000)
: The Complexity of Model Checking for Circumscriptive Formulae.
Inf. Process. Lett.
(IPL)
44(3):113-118 (1992)