-
1
-
-
21044449695
-
Persistent authenticated dictionaries and their applications
-
Proc. Information Security Conference (ISC 2001), Springer-Verlag
-
A. Anagnostopoulos, M. T. Goodrich, and R. Tamassia. Persistent authenticated dictionaries and their applications. In Proc. Information Security Conference (ISC 2001), volume 2200 of LNCS, pages 379-393. Springer-Verlag, 2001.
-
(2001)
LNCS
, vol.2200
, pp. 379-393
-
-
Anagnostopoulos, A.1
Goodrich, M.T.2
Tamassia, R.3
-
2
-
-
0027206124
-
Checking approximate computations over the reals
-
S. Ar, M. Blum, B. Codenotti, and P. Gemmell. Checking approximate computations over the reals. In Proc. ACM Symp. on the Theory of Computing, pages 786-795, 1993.
-
(1993)
Proc. ACM Symp. on the Theory of Computing
, pp. 786-795
-
-
Ar, S.1
Blum, M.2
Codenotti, B.3
Gemmell, P.4
-
4
-
-
0029214558
-
Designing programs that check their work
-
Jan.
-
M. Blum and S. Kannan. Designing programs that check their work. J. ACM, 42(1):269-291, Jan. 1995.
-
(1995)
J. ACM
, vol.42
, Issue.1
, pp. 269-291
-
-
Blum, M.1
Kannan, S.2
-
9
-
-
3543102859
-
Dynamic accumulators and application to efficient revocation of anonymous credentials
-
J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Proc. CRYPTO, 2002.
-
(2002)
Proc. CRYPTO
-
-
Camenisch, J.1
Lysyanskaya, A.2
-
10
-
-
0023010037
-
Fractional cascading: I. a data structuring technique
-
B. Chazelle and L. J. Guibas. Fractional cascading: I. A data structuring technique. Algorithmica, 1(3):133-162, 1986.
-
(1986)
Algorithmica
, vol.1
, Issue.3
, pp. 133-162
-
-
Chazelle, B.1
Guibas, L.J.2
-
11
-
-
0023010035
-
Fractional cascading: II. Applications
-
B. Chazelle and L. J. Guibas. Fractional cascading: II. Applications. Algorithmica, 1:163-191, 1986.
-
(1986)
Algorithmica
, vol.1
, pp. 163-191
-
-
Chazelle, B.1
Guibas, L.J.2
-
13
-
-
0035748036
-
Flexible authentication of XML documents
-
P. Devanbu, M. Gertz, A. Kwong, C. Martel, G. Nuckolls, and S. Stubblebine. Flexible authentication of XML documents. In Proc. ACM Conference on Computer and Communications Security, 2001.
-
(2001)
Proc. ACM Conference on Computer and Communications Security
-
-
Devanbu, P.1
Gertz, M.2
Kwong, A.3
Martel, C.4
Nuckolls, G.5
Stubblebine, S.6
-
15
-
-
0346838140
-
Checking the convexity of polytopes and the planarity of subdivisions
-
O. Devillers, G. Liotta, F. P. Preparata, and R. Tamassia. Checking the convexity of polytopes and the planarity of subdivisions. Comput. Geom. Theory Appl., 11:187-208, 1998.
-
(1998)
Comput. Geom. Theory Appl.
, vol.11
, pp. 187-208
-
-
Devillers, O.1
Liotta, G.2
Preparata, F.P.3
Tamassia, R.4
-
16
-
-
84957863642
-
Upward planarity checking: "Faces are more than polygons"
-
S.H. Whitesides, editor, Graph Drawing (Proc. GD '98), Springer-Verlag
-
G. Di Battista and G. Liotta. Upward planarity checking: "Faces are more than polygons". In S.H. Whitesides, editor, Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes Comput. Sci., pages 72-86. Springer-Verlag, 1998.
-
(1998)
Lecture Notes Comput. Sci.
, vol.1547
, pp. 72-86
-
-
Di Battista, G.1
Liotta, G.2
-
17
-
-
1542577522
-
On-line maintenance of triconnected components with SPQR-trees
-
G. Di Battista and R. Tamassia. On-line maintenance of triconnected components with SPQR-trees. Algorithmica, 15:302-318, 1996.
-
(1996)
Algorithmica
, vol.15
, pp. 302-318
-
-
Di Battista, G.1
Tamassia, R.2
-
18
-
-
38249015356
-
Maintenance of a minimum spanning forest in a dynamic plane graph
-
D. Eppstein, G. F. Italiano, R. Tamassia, R. E. Tarjan, J. Westbrook, and M. Yung. Maintenance of a minimum spanning forest in a dynamic plane graph. J. Algorithms, 13(1):33-54, 1992.
-
(1992)
J. Algorithms
, vol.13
, Issue.1
, pp. 33-54
-
-
Eppstein, D.1
Italiano, G.F.2
Tamassia, R.3
Tarjan, R.E.4
Westbrook, J.5
Yung, M.6
-
20
-
-
84957806727
-
Efficient and fresh certification
-
Int. Workshop on Practice and Theory in Public Key Cryptography (PKC '2000), Springer-Verlag
-
I. Gassko, P. S. Gemmell, and P. MacKenzie. Efficient and fresh certification. In Int. Workshop on Practice and Theory in Public Key Cryptography (PKC '2000), volume 1751 of LNCS, pages 342-353. Springer-Verlag, 2000.
-
(2000)
LNCS
, vol.1751
, pp. 342-353
-
-
Gassko, I.1
Gemmell, P.S.2
MacKenzie, P.3
-
22
-
-
84945279475
-
An efficient dynamic and distributed cryptographic accumulator
-
Proc. Int. Security Conference (ISC 2002), Springer-Verlag
-
M. T. Goodrich, R. Tamassia, and J. Hasic. An efficient dynamic and distributed cryptographic accumulator. In Proc. Int. Security Conference (ISC 2002), volume 2433 of LNCS, pages 372-388. Springer-Verlag, 2002.
-
(2002)
LNCS
, vol.2433
, pp. 372-388
-
-
Goodrich, M.T.1
Tamassia, R.2
Hasic, J.3
-
23
-
-
84964426510
-
Implementation of an authenticated dictionary with skip lists and commutative hashing
-
M. T. Goodrich, R. Tamassia, and A. Schwerin. Implementation of an authenticated dictionary with skip lists and commutative hashing. In Proc. 2001 DARPA Information Survivability Conference and Exposition, volume 2, pages 68-82, 2001.
-
(2001)
Proc. 2001 DARPA Information Survivability Conference and Exposition
, vol.2
, pp. 68-82
-
-
Goodrich, M.T.1
Tamassia, R.2
Schwerin, A.3
-
24
-
-
84958043500
-
A simpler minimum spanning tree verification algorithm
-
V. King. A simpler minimum spanning tree verification algorithm. In Workshop on Algorithms and Data Structures, pages 440-448, 1995.
-
(1995)
Workshop on Algorithms and Data Structures
, pp. 440-448
-
-
King, V.1
-
25
-
-
84958063551
-
On certificate revocation and validation
-
Proc. Int. Conf. on Financial Cryptography, Springer-Verlag
-
P. G. Kocher. On certificate revocation and validation. In Proc. Int. Conf. on Financial Cryptography, volume 1465 of LNCS. Springer-Verlag, 1998.
-
(1998)
LNCS
, vol.1465
-
-
Kocher, P.G.1
-
30
-
-
0012821270
-
Checking geometric programs or verification of geometric structures
-
K. Mehlhorn, S. Näher, M. Seel, R. Seidel, T. Schilz, S. Schirra, and C. Uhrig. Checking geometric programs or verification of geometric structures. Comput. Geom. Theory Appl., 12(1-2):85-103, 1999.
-
(1999)
Comput. Geom. Theory Appl.
, vol.12
, Issue.1-2
, pp. 85-103
-
-
Mehlhorn, K.1
Näher, S.2
Seel, M.3
Seidel, R.4
Schilz, T.5
Schirra, S.6
Uhrig, C.7
-
31
-
-
84920380941
-
Protocols for public key cryptosystems
-
IEEE Computer Society Press
-
R. C. Merkle. Protocols for public key cryptosystems. In Proc. Symp. on Security and Privacy, pages 122-134. IEEE Computer Society Press, 1980.
-
(1980)
Proc. Symp. on Security and Privacy
, pp. 122-134
-
-
Merkle, R.C.1
-
32
-
-
84969346266
-
A certified digital signature
-
G. Brassard, editor, Proc. CRYPTO '89, Springer-Verlag
-
R. C. Merkle. A certified digital signature. In G. Brassard, editor, Proc. CRYPTO '89, volume 435 of LNCS, pages 218-238. Springer-Verlag, 1990.
-
(1990)
LNCS
, vol.435
, pp. 218-238
-
-
Merkle, R.C.1
-
33
-
-
85084162561
-
Certificate revocation and certificate update
-
Berkeley
-
M. Naor and K. Nissim. Certificate revocation and certificate update. In Proc. 7th USENIX Security Symposium, pages 217-228, Berkeley, 1998.
-
(1998)
Proc. 7th USENIX Security Symposium
, pp. 217-228
-
-
Naor, M.1
Nissim, K.2
-
35
-
-
0025436383
-
Skip lists: A probabilistic alternative to balanced trees
-
W. Pugh. Skip lists: a probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
-
(1990)
Commun. ACM
, vol.33
, Issue.6
, pp. 668-676
-
-
Pugh, W.1
-
36
-
-
0020766586
-
A data structure for dynamic trees
-
D.D. Sleator and R.E. Tarjan. A data structure for dynamic trees. J. Comput. Syst. Sci., 26(3):362-381, 1983.
-
(1983)
J. Comput. Syst. Sci.
, vol.26
, Issue.3
, pp. 362-381
-
-
Sleator, D.D.1
Tarjan, R.E.2
-
38
-
-
0029344123
-
Certification of computational results
-
G.F. Sullivan, D.S. Wilson, and G.M. Masson. Certification of computational results. IEEE Trans. Comput., 44(7):833-847, 1995.
-
(1995)
IEEE Trans. Comput.
, vol.44
, Issue.7
, pp. 833-847
-
-
Sullivan, G.F.1
Wilson, D.S.2
Masson, G.M.3
-
39
-
-
0026626071
-
Maintaining bridge-connected and biconnected components on-line
-
J. Westbrook and R. E. Tarjan. Maintaining bridge-connected and biconnected components on-line. Algorithmica, 7:433-464, 1992.
-
(1992)
Algorithmica
, vol.7
, pp. 433-464
-
-
Westbrook, J.1
Tarjan, R.E.2
|