Lars Arge, Peter Bro Miltersen  Home/Search
Context Related
| daimi.au.dk/~bromille/Pape...indivis.ps brics.aau.dk/~bromille/Pap...indivis.ps brics.dk/Projects/...ArgeMiltersen98.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: daimi.au.dk/~bromille/Pap...index (more) From: brics.aau.dk/~bromille/Papers/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . In this paper we consider lower bounds for external-memory computational geometry problems. We find that it is not quite clear which model of computation to use when considering such problems. As an attempt of providing a model, we define the external memory Turing machine model, and we derive lower bounds for a number of problems, including the element distinctness problem, in this model. For these lower bounds we make the standard assumption that records are indivisible. Waiving the... (Update)
Context of citations to this paper: More
...lowest common ancestors, topological sorting, etc. are presented in [11] For lower bounds for computational geometry problems in EM, see [3]. Also see [2] for bu er trees, priority queues, and their applications. For the geometric problems discussed in this paper, the best...
Cited by: More
Hierarchical Indexing for Out-of-Core Access to.. - Pascucci, Frank (Correct)
Lower Bounds for External Memory Dictionaries - Brodal, Fagerberg (Correct)
Terrain Simplification Simplified: A General Framework for.. - Lindstrom, Pascucci (2002) (Correct)
Active bibliography (related documents): More All
0.7: On Showing Lower Bounds for External-Memory Computational.. - Arge, Miltersen (Correct)
0.3: External Memory Algorithms and Data Structures - Vitter (1999) (Correct)
0.2: New Results on Geometric Spanners and Their Applications - Lukovszki (1999) (Correct)
Similar documents based on text: More All
0.5: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
0.4: External-Memory Computational Geometry - Goodrich, Tsay, Vengroff, Vitter (1993) (Correct)
0.4: External-Memory Algorithms for Processing Line Segments.. - Arge, al. (1995) (Correct)
Related documents from co-citation: More All
10: External-Memory Computational Geometry - Goodrich, Tsay et al. - 1993
5: Introduction to algorithms (context) - Cormen, Leiserson et al. - 1991
5: External-Memory Algorithms for Processing Line Segments in Geographic Informatio.. - Arge, Vengroff et al. - 1995
BibTeX entry: (Update)
L. Arge and P. B. Miltersen. On showing lower bounds for external-memory computational geometry. In preparation. http://citeseer.ist.psu.edu/196689.html More
@incollection{ arge99showing,
author = "Lars Arge and Peter Bro Miltersen",
title = "On showing lower bounds for external-memory computational geometry problems",
booktitle = "External Memory Algorithms and Visualization",
publisher = "American Mathematical Society Press",
address = "Providence, RI",
editor = "James Abello and Jeffrey Scott Vitter",
pages = "139--160",
year = "1999",
url = "citeseer.ist.psu.edu/196689.html" }
Citations (may not include all citations):2003 The art of computer programming (context) - Knuth - 1973
1254 Computational geometry: An introduction (context) - Preparata, Shamos - 1985
358 Universal classes of hash functions (context) - Carter, Wegman - 1979 DBLP
284 An introduction to disk drive modeling - Ruemmler, Wilkes - 1994 ACM DBLP
124 Lower bounds for algebraic computation trees (context) - Ben-Or - 1983 ACM
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
113 Output complexity of sorting and related problems (context) - Aggarwal, Vitter et al. - 1988
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995 ACM DBLP
56 Sorting in linear time - Andersson, Hagerup et al. - 1995
43 Recursive unsolvability of Post's problem of 'tag' and other.. (context) - Minsky - 1961
24 complexity of ordered binary-decision diagram manipulation (context) - Arge, O- - 1995
19 Theory and practice of I/O-efficient algorithms for multidim.. - Arge, Procopiuc et al. - 1998 ACM
14 Proving simultaneous positivity of linear forms (context) - Rabin - 1972
13 A general lower bound on the I/O-complexity of comparison-ba.. (context) - Arge, Knudsen et al. - 1993 ACM DBLP
13 On sorting strings in external memory - Arge, Ferragina et al. - 1997
12 Applications of Ramsey's theorem to decision tree complexity - Moran, Snir et al. - 1985
10 New coding techniques for improved bandwidth utilization - Adler - 1996 ACM DBLP
5 the optimality of some set algorithms (context) - Reingold - 1972
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.daimi.au.dk/~bromille/Papers/index.html): More
Error Correcting Codes, Perfect Hashing Circuits, and.. - Miltersen (1998) (Correct)
Lower bounds for Union-Split-Find related problems on random.. - Miltersen (1994) (Correct)
Searching constant width mazes captures the AC0 hierarchy - Barrington, Lu, Miltersen, .. (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC