Howard J. Karloff

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 Sundar Vishwanathan

> Home > Persons > Howard J. Karloff

Publications

1998
[j19]
- view
  authority control:
- export record
  dblp key:
  - journals/siamcomp/FiatFKRRV98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/FiatFKRRV98
Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal. SIAM J. Comput. 28(2): 447-462 (1998)
1991
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/siamdm/ChrobakKPV91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/ChrobakKPV91
Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan:
New Results on Server Problems. SIAM J. Discret. Math. 4(2): 172-181 (1991)
[c7]
- view
  authority control:
- export record
  dblp key:
  - conf/focs/FiatFKRRV91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/focs/FiatFKRRV91
Amos Fiat, Dean P. Foster, Howard J. Karloff, Yuval Rabani, Yiftach Ravid, Sundar Vishwanathan:
Competitive Algorithms for Layered Graph Traversal. FOCS 1991: 288-297
1990
[c3]
- view
  - electronic edition @ acm.org
  - no references & citations available
- export record
  dblp key:
  - conf/soda/ChrobakKPV90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ChrobakKPV90
Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan:
New Results on Server Problems. SODA 1990: 291-300

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.