2007 |
42 | EE | Walter A. Burkhard:
Efficient External Table Reordering.
MASCOTS 2007: 124-131 |
2006 |
41 | EE | Barbara T. Theodorides,
Walter A. Burkhard:
B: Disk Array Data Layout Tolerating Multiple Failures.
MASCOTS 2006: 21-32 |
2005 |
40 | EE | Walter A. Burkhard:
External Double Hashing with Choice.
ISPAN 2005: 100-107 |
39 | EE | Walter A. Burkhard:
Double hashing with passbits.
Inf. Process. Lett. 96(5): 162-166 (2005) |
2003 |
38 | EE | Paul M. Martini,
Walter A. Burkhard:
Double Hashing With Multiple Passbits.
Int. J. Found. Comput. Sci. 14(6): 1165- (2003) |
2001 |
37 | EE | Ariel Cohen,
Walter A. Burkhard:
Segmented Information Dispersal (SID) Data Layouts for Digital Video Servers.
IEEE Trans. Knowl. Data Eng. 13(4): 593-606 (2001) |
1999 |
36 | EE | Thomas J. E. Schwarz,
Jesse Steinberg,
Walter A. Burkhard:
Permutation Development Data Layout (PDDL).
HPCA 1999: 214-217 |
1998 |
35 | EE | Guillermo A. Alvarez,
Walter A. Burkhard,
Larry J. Stockmeyer,
Flaviu Cristian:
Declustered Disk Array Architectures with Optimal and Near-Optimal Parallelism.
ISCA 1998: 109-120 |
1997 |
34 | EE | Guillermo A. Alvarez,
Walter A. Burkhard,
Flaviu Cristian:
Tolerating Multiple Failures in RAID Architectures with Optimal Storage and Uniform Declustering.
ISCA 1997: 62-72 |
1996 |
33 | | Ariel Cohen,
Walter A. Burkhard:
Segmented Information Dispersal (SID) for Efficient Reconstruction in Fault-Tolerant Video Servers.
ACM Multimedia 1996: 277-286 |
1995 |
32 | | Ariel Cohen,
Walter A. Burkhard,
P. Venkat Rangan:
Pipelined Disk Arrays for Digital Movie Retrieval.
ICMCS 1995: 312-317 |
1993 |
31 | | Walter A. Burkhard,
Jai Menon:
Disk Array Storage System Reliability.
FTCS 1993: 432-441 |
1992 |
30 | | Thomas J. E. Schwarz,
Walter A. Burkhard:
RAID Organization and Performance.
ICDCS 1992: 318-325 |
1991 |
29 | | P. Venkat Rangan,
Walter A. Burkhard,
Robert W. Rowdidge,
Harrick M. Vin,
John W. Lindwall,
Kashun Chan,
Ingvar A. Aaberg,
Linda M. Yamamoto,
Ian G. Harris:
A Testbed for Managing Digital Video and Audio Storage.
USENIX Summer 1991: 199-208 |
1990 |
28 | | Thomas J. E. Schwarz,
Robert W. Bowdidgem,
Walter A. Burkhard:
Low-Cost Comparisons of File Copies.
ICDCS 1990: 196-202 |
1989 |
27 | | Marina Roesler,
Walter A. Burkhard:
Resolution of Deadlocks in Object-Oriented Distributed Systems.
IEEE Trans. Computers 38(8): 1212-1224 (1989) |
26 | EE | Walter A. Burkhard,
Bruce E. Martin,
Jehan-François Pâris:
The Gemini replicated-file system testbed.
Inf. Sci. 48(2): 119-134 (1989) |
1988 |
25 | | Marina Roesler,
Walter A. Burkhard,
Kenneth B. Cooper:
Efficient Deadlock Resolution for Lock-Based Concurrency Control Schemes.
ICDCS 1988: 224-233 |
24 | EE | Marina Roesler,
Walter A. Burkhard:
Deadlock Resolution and Semantic Lock Models in Object-Oriented Distributed Systems.
SIGMOD Conference 1988: 361-370 |
1987 |
23 | | Marina Roesler,
Walter A. Burkhard:
Concurrency Control Scheme for Shared Objects: A Peephole Approach Based on Semantics (extended abstract).
ICDCS 1987: 224-231 |
22 | EE | Walter A. Burkhard,
Bruce E. Martin,
Jehan-François Pâris:
The Gemini Replicated File System Test-bed.
ICDE 1987: 441-448 |
21 | EE | C. Thomas Wu,
Walter A. Burkhard:
Associative Searching in Multiple Storage Units.
ACM Trans. Database Syst. 12(1): 38-64 (1987) |
1986 |
20 | | Walter A. Burkhard:
Index Maintenance for Non-Uniform Record Distribution.
Advances in Computing Research 3: 375-394 (1986) |
1985 |
19 | | Danco Davcev,
Walter A. Burkhard:
Consistency and Recovery Control for Replicated Files.
SOSP 1985: 87-96 |
1984 |
18 | EE | Walter A. Burkhard:
Index Maintenance for Non-Uniform Record Distributions.
PODS 1984: 173-179 |
1983 |
17 | EE | Walter A. Burkhard:
Interpolation-Based Index Maintenance.
PODS 1983: 76-89 |
16 | | Walter A. Burkhard:
Interpolation-Based Index Maintenance.
BIT 23(3): 274-294 (1983) |
1981 |
15 | | Walter A. Burkhard,
Michael L. Fredman,
Daniel J. Kleitman:
Inherent Complexity Trade-Offs for Range Query Problems.
Theor. Comput. Sci. 16: 279-290 (1981) |
1979 |
14 | EE | Walter A. Burkhard:
Partial-Match Hash Coding: Benefits of Redundancy.
ACM Trans. Database Syst. 4(2): 228-239 (1979) |
1978 |
13 | | Nancy D. Anderson,
Walter A. Burkhard:
Minisequel - Relational Data Management System.
JCDKB 1978: 57- |
1977 |
12 | EE | Ann Marie Walsh,
Walter A. Burkhard:
Efficient algorithms for (3, 1) graphs.
Inf. Sci. 13(1): 1-10 (1977) |
11 | | Walter A. Burkhard:
Associative Retrieval Trie Hash-Coding.
J. Comput. Syst. Sci. 15(3): 280-299 (1977) |
10 | | Walter A. Burkhard:
Non-Uniform Partial-Match File Designs.
Theor. Comput. Sci. 5(1): 1-23 (1977) |
1976 |
9 | | Walter A. Burkhard:
Associative Retrieval Trie Hash-Coding
STOC 1976: 211-219 |
8 | EE | Walter A. Burkhard:
Hashing and Trie Algorithms for Partial Match Retrieval.
ACM Trans. Database Syst. 1(2): 175-187 (1976) |
7 | | Jon Louis Bentley,
Walter A. Burkhard:
Heuristics for Partial-Match Retrieval Data Base Design.
Inf. Process. Lett. 4(5): 132-135 (1976) |
1975 |
6 | EE | Walter A. Burkhard:
Partial-Match Queries and File Designs.
VLDB 1975: 523-525 |
5 | | Walter A. Burkhard:
Full Table Quadratic Quotient Searching.
Comput. J. 18(2): 161-163 (1975) |
4 | | Walter A. Burkhard:
Nonrecursive Traversals of Trees.
Comput. J. 18(3): 227-230 (1975) |
1973 |
3 | | Walter A. Burkhard,
Robert M. Keller:
Some Approaches to Best-Match File Searching.
Commun. ACM 16(4): 230-236 (1973) |
1971 |
2 | | Walter A. Burkhard,
F. W. Kroon:
Toward a Weakly Invariant Complexity Theory
FOCS 1971: 24-32 |
1970 |
1 | | Walter A. Burkhard:
Complexity Problems in Real Time Computation
STOC 1970: 62-69 |