![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Edward F. Grove
Person information
- affiliation: Duke University, Durham, Department of Computer Science
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
- [j5]Yair Bartal, Eddie Grove:
The harmonic k-server algorithm is competitive. J. ACM 47(1): 1-15 (2000) - [j4]Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter
:
Application-Controlled Paging for a Shared Cache. SIAM J. Comput. 29(4): 1290-1303 (2000) - [j3]Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter
:
Binary Space Partitions for Fat Rectangles. SIAM J. Comput. 29(5): 1422-1448 (2000)
1990 – 1999
- 1999
- [j2]Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter
:
The Object Complexity Model for Hidden-Surface Removal. Int. J. Comput. Geom. Appl. 9(2): 207-217 (1999) - 1997
- [j1]Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter
:
Simple Randomized Mergesort on Parallel Disks. Parallel Comput. 23(4-5): 601-631 (1997) - [c11]Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter:
Simple randomized Mergesort on parallel disks. Randomization Methods in Algorithm Design 1997: 1-20 - 1996
- [c10]Pankaj K. Agarwal, Edward F. Grove, T. M. Murali, Jeffrey Scott Vitter:
Binary Search Partitions for Fat Rectangles. FOCS 1996: 482-491 - [c9]Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter
:
Simple Randomized Mergesort on Parallel Disks. SPAA 1996: 109-118 - 1995
- [c8]Rakesh D. Barve, Edward F. Grove, Jeffrey Scott Vitter:
Application-Controlled Paging for a Shared Cache (Extended Abstract). FOCS 1995: 204-213 - [c7]Baruch Awerbuch, Yossi Azar, Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter:
Load Balancing in the Lp Norm. FOCS 1995: 383-391 - [c6]Yi-Jen Chiang, Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter:
External-Memory Graph Algorithms. SODA 1995: 139-149 - [c5]Edward F. Grove:
Online Bin Packing with Lookahead. SODA 1995: 430-436 - [c4]Edward F. Grove, Ming-Yang Kao, P. Krishnan, Jeffrey Scott Vitter
:
Online Perfect Matching and Mobile Computing. WADS 1995: 194-205 - 1992
- [c3]Edward F. Grove:
Connected Components and the Interval Graph. SPAA 1992: 382-391 - 1991
- [c2]Edward F. Grove:
The Harmonic Online K-Server Algorithm in Competitive. On-Line Algorithms 1991: 65-76 - [c1]Edward F. Grove:
The Harmonic Online K-Server Algorithm Is Competitive. STOC 1991: 260-266
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint