default search action
Walter A. Burkhard
Person information
- affiliation: University of California, San Diego, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2005
- [j21]Walter A. Burkhard:
Double hashing with passbits. Inf. Process. Lett. 96(5): 162-166 (2005) - 2003
- [j20]Paul M. Martini, Walter A. Burkhard:
Double Hashing With Multiple Passbits. Int. J. Found. Comput. Sci. 14(6): 1165- (2003) - 2001
- [j19]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) - 1995
- [j18]Ariel Cohen, Walter A. Burkhard:
A proof of the optimality of the MIN paging algorithm using linear programming duality. Oper. Res. Lett. 18(1): 7-13 (1995) - 1990
- [j17]F. W. Kroon, Walter A. Burkhard:
On a complexity-based way of constructivizing the recursive functions. Stud Logica 49(1): 133-149 (1990) - 1989
- [j16]Walter A. Burkhard, Bruce E. Martin, Jehan-François Pâris:
The Gemini replicated-file system testbed. Inf. Sci. 48(2): 119-134 (1989) - [j15]Marina Roesler, Walter A. Burkhard:
Resolution of Deadlocks in Object-Oriented Distributed Systems. IEEE Trans. Computers 38(8): 1212-1224 (1989) - 1987
- [j14]C. Thomas Wu, Walter A. Burkhard:
Associative Searching in Multiple Storage Units. ACM Trans. Database Syst. 12(1): 38-64 (1987) - 1986
- [j13]Walter A. Burkhard:
Index Maintenance for Non-Uniform Record Distribution. Adv. Comput. Res. 3: 375-394 (1986) - 1983
- [j12]Walter A. Burkhard:
Interpolation-Based Index Maintenance. BIT 23(3): 274-294 (1983) - 1981
- [j11]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
- [j10]Walter A. Burkhard:
Partial-Match Hash Coding: Benefits of Redundancy. ACM Trans. Database Syst. 4(2): 228-239 (1979) - 1977
- [j9]Ann Marie Walsh, Walter A. Burkhard:
Efficient algorithms for (3, 1) graphs. Inf. Sci. 13(1): 1-10 (1977) - [j8]Walter A. Burkhard:
Associative Retrieval Trie Hash-Coding. J. Comput. Syst. Sci. 15(3): 280-299 (1977) - [j7]Walter A. Burkhard:
Non-Uniform Partial-Match File Designs. Theor. Comput. Sci. 5(1): 1-23 (1977) - 1976
- [j6]Jon Louis Bentley, Walter A. Burkhard:
Heuristics for Partial-Match Retrieval Data Base Design. Inf. Process. Lett. 4(5): 132-135 (1976) - [j5]Walter A. Burkhard:
Hashing and Trie Algorithms for Partial Match Retrieval. ACM Trans. Database Syst. 1(2): 175-187 (1976) - 1975
- [j4]Walter A. Burkhard:
Full Table Quadratic Quotient Searching. Comput. J. 18(2): 161-163 (1975) - [j3]Walter A. Burkhard:
Nonrecursive Traversals of Trees. Comput. J. 18(3): 227-230 (1975) - 1973
- [j2]Walter A. Burkhard, Robert M. Keller:
Some Approaches to Best-Match File Searching. Commun. ACM 16(4): 230-236 (1973) - 1971
- [j1]Walter A. Burkhard, Pravin Varaiya:
Complexity problems in real time languages. Inf. Sci. 3(1): 87-100 (1971)
Conference and Workshop Papers
- 2007
- [c26]Walter A. Burkhard:
Efficient External Table Reordering. MASCOTS 2007: 124-131 - 2006
- [c25]Barbara T. Theodorides, Walter A. Burkhard:
B: Disk Array Data Layout Tolerating Multiple Failures. MASCOTS 2006: 21-32 - 2005
- [c24]Walter A. Burkhard:
External Double Hashing with Choice. ISPAN 2005: 100-107 - 1999
- [c23]Thomas J. E. Schwarz, Jesse Steinberg, Walter A. Burkhard:
Permutation Development Data Layout (PDDL). HPCA 1999: 214-217 - 1998
- [c22]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
- [c21]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
- [c20]Ariel Cohen, Walter A. Burkhard:
Segmented Information Dispersal (SID) for Efficient Reconstruction in Fault-Tolerant Video Servers. ACM Multimedia 1996: 277-286 - [c19]J. E. Thomas, S. J. Schwarz, Walter A. Burkhard:
Almost complete address translation (ACATS) disk array declustering. SPDP 1996: 324-331 - 1995
- [c18]Ariel Cohen, Walter A. Burkhard, P. Venkat Rangan:
Pipelined Disk Arrays for Digital Movie Retrieval. ICMCS 1995: 312-317 - 1993
- [c17]Walter A. Burkhard, Jai Menon:
Disk Array Storage System Reliability. FTCS 1993: 432-441 - 1992
- [c16]Thomas J. E. Schwarz, Walter A. Burkhard:
RAID Organization and Performance. ICDCS 1992: 318-325 - 1991
- [c15]Walter A. Burkhard, Kimberly C. Claffy, Thomas J. E. Schwarz:
Performance of balanced disk array schemes. MSS 1991: 45-50 - [c14]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
- [c13]Thomas J. E. Schwarz, Robert W. Bowdidge, Walter A. Burkhard:
Low-Cost Comparisons of File Copies. ICDCS 1990: 196-202 - 1988
- [c12]Marina Roesler, Walter A. Burkhard, Kenneth B. Cooper:
Efficient Deadlock Resolution for Lock-Based Concurrency Control Schemes. ICDCS 1988: 224-233 - [c11]Marina Roesler, Walter A. Burkhard:
Deadlock Resolution and Semantic Lock Models in Object-Oriented Distributed Systems. SIGMOD Conference 1988: 361-370 - 1987
- [c10]Marina Roesler, Walter A. Burkhard:
Concurrency Control Scheme for Shared Objects: A Peephole Approach Based on Semantics (extended abstract). ICDCS 1987: 224-231 - [c9]Walter A. Burkhard, Bruce E. Martin, Jehan-François Pâris:
The Gemini Replicated File System Test-bed. ICDE 1987: 441-448 - 1985
- [c8]Danco Davcev, Walter A. Burkhard:
Consistency and Recovery Control for Replicated Files. SOSP 1985: 87-96 - 1984
- [c7]Walter A. Burkhard:
Index Maintenance for Non-Uniform Record Distributions. PODS 1984: 173-179 - 1983
- [c6]Walter A. Burkhard:
Interpolation-Based Index Maintenance. PODS 1983: 76-89 - 1978
- [c5]Nancy D. Anderson, Walter A. Burkhard:
Minisequel - Relational Data Management System. JCDKB 1978: 57- - 1976
- [c4]Walter A. Burkhard:
Associative Retrieval Trie Hash-Coding. STOC 1976: 211-219 - 1975
- [c3]Walter A. Burkhard:
Partial-Match Queries and File Designs. VLDB 1975: 523-525 - 1971
- [c2]Walter A. Burkhard, F. W. Kroon:
Toward a Weakly Invariant Complexity Theory. SWAT 1971: 24-32 - 1970
- [c1]Walter A. Burkhard:
Complexity Problems in Real Time Computation. STOC 1970: 62-69
Editorship
- 1982
- [e4]Harry R. Lewis, Barbara B. Simons, Walter A. Burkhard, Lawrence H. Landweber:
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5-7, 1982, San Francisco, California, USA. ACM 1982, ISBN 0-89791-067-2 [contents] - 1980
- [e3]Raymond E. Miller, Seymour Ginsburg, Walter A. Burkhard, Richard J. Lipton:
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, April 28-30, 1980, Los Angeles, California, USA. ACM 1980 [contents] - 1979
- [e2]Michael J. Fischer, Richard A. DeMillo, Nancy A. Lynch, Walter A. Burkhard, Alfred V. Aho:
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA. ACM 1979 [contents] - 1978
- [e1]Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho:
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. ACM 1978 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint