Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Alfred Z. Spector

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Joshua J. Bloch

> Home > Persons > Alfred Z. Spector

Publications

1987
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/jacm/BlochDS87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/BlochDS87
Joshua J. Bloch, Dean S. Daniels, Alfred Z. Spector:
A weighted voting algorithm for replicated directories. J. ACM 34(4): 859-909 (1987)
[c14]
- view
  authority control:
- export record
  dblp key:
  - conf/hpts/SpectorEDDBDPT87
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/hpts/SpectorEDDBDPT87
Alfred Z. Spector, Jeffrey L. Eppinger, Dean S. Daniels, Richard Draves, Joshua J. Bloch, Dan Duchamp, Randy F. Pausch, Dean S. Thompson:
High Performance Distributed Transaction Processing in a General Purpose Computing Environment. HPTS 1987: 220-242
1986
[j10]
- view
  - electronic edition @ computer.org (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/debu/SpectorBDDDEMT86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/debu/SpectorBDDDEMT86
Alfred Z. Spector, Joshua J. Bloch, Dean S. Daniels, Richard Draves, Dan Duchamp, Jeffrey L. Eppinger, Sherri G. Menees, Dean S. Thompson:
The Camelot Project. IEEE Database Eng. Bull. 9(3): 23-34 (1986)

a service of

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.