Lars Arge  Home/Search
Context Related
| mpisb.mpg.de/~cra...RICSDS963.ps.gz brics.dk/RS/96/28/...ICSRS9628.ps.gz duke.edu/~jsv/Pape...7.SegmentGIS.ps.gz 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 Problem Downloading? From: mpisb.mpg.de/~crauser/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this thesis we study the Input/Output (I/O) complexity of large-scale problems arising e.g. in the areas of database systems, geographic information systems, VLSI design systems and computer graphics, and design I/O-efficient algorithms for them. A general theme in our work is to design I/O-efficient algorithms through the design of I/O-efficient data structures. One of our philosophies is to try to isolate all the I/O specific parts of an algorithm in the data structures, that is, to try... (Update)
Cited by: More
DOI: 10.1007/s00453-002-1009-y - Algorithmica Algorithmica.. (Correct)
Reducing I/O Complexity by Simulating - Coarse Grained Parallel (Correct)
Efficient External Memory Algorithms by Simulating.. - Dehne, Dittrich, al. (2003) (Correct)
Similar documents (at the sentence level): More
76.2%: Efficient External-Memory Data Structures and Applications - Arge (1996) (Correct)
16.9%: Optimal Dynamic Interval Management in External Memory - Arge (1996) (Correct)
11.5%: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1998) (Correct)
Active bibliography (related documents): More All
1.1: External Memory Data Structures - Arge (2000) (Correct)
0.8: Parallel Algorithms in External Memory - Hutchinson (2000) (Correct)
0.8: External-Memory Algorithms for Processing Line Segments.. - Arge, Vengroff, Vitter (1995) (Correct)
Similar documents based on text: More All
1.4: Topics in Semantics-based Program Manipulation - Grobauer (2001) (Correct)
1.3: Reasoning in the Temporal Logic of Actions - The Design and.. - Engberg (1996) (Correct)
1.2: The Complexity of Identifying Large Equivalence Classes - Binderup, Frandsen.. (1998) (Correct)
Related documents from co-citation: More All
26: External-memory graph algorithms - Chiang, Goodrich et al. - 1995
22: Output Complexity of Sorting and Related Problems (context) - Aggarwal, Vitter - 1988
20: External-Memory Computational Geometry - Goodrich, Tsay et al. - 1993
BibTeX entry: (Update)
L. Arge. Efficient External-Memory Data Structures and Applications, Ph.D Thesis, BRICS, University of Aarhus, 1996. http://citeseer.ist.psu.edu/arge96efficient.html More
@misc{ arge96efficient,
author = "L. Arge",
title = "Efficient External-Memory Data Structures and Applications",
text = "L. Arge. Efficient External-Memory Data Structures and Applications, Ph.D
Thesis, BRICS, University of Aarhus, 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/arge96efficient.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - Knuth - 1973
1726 Graph-based algorithms for boolean function manipulation - Bryant - 1986 ACM DBLP
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
765 trees: A dynamic index structure for spatial searching (context) - Guttman - 1985
510 Symbolic boolean manipulation with ordered binary-decision d.. - Bryant - 1992 ACM DBLP
316 Efficient implementation of a BDD package (context) - Brace, Rudell et al. - 1990 ACM DBLP
315 Constraint query languages - Kanellakis, Kuper et al. - 1990
284 An introduction to disk drive modeling - Ruemmler, Wilkes - 1994 ACM DBLP
275 Dynamic variable ordering for ordered binary decision diagra.. (context) - Rudell - 1993 ACM
233 tree: A dynamic index for multidimensional objects - Sellis, Roussopoulos et al. - 1987
229 Applications of Spatial Data Structures: Computer Graphics (context) - Samet - 1989
198 Organization and maintenance of large ordered indizes (context) - Bayer, McCreight - 1972
180 Triangulating a simple polygon in linear time (context) - Chazelle - 1990 ACM DBLP
174 Time bounds for selection (context) - Blum, Floyd et al. - 1973 DBLP
169 Algorithms for reporting and counting geometric intersection.. (context) - Bentley, Ottmann - 1979 DBLP
144 symmetric multikey file structure (context) - Nievergelt, Hinterberger et al. - 1984
134 Spatial query processing in an object-oriented database syst.. (context) - Orenstein - 1986 ACM DBLP
130 tree: A search structure for large multidimensional dynamic .. (context) - Robinson - 1984
124 Lower bounds for algebraic computation trees (context) - Ben-Or - 1983 ACM
121 External-memory computational geometry - Goodrich, Tsay et al. - 1993
114 An optimal algorithm for intersecting line segments in the p.. (context) - Chazelle, Edelsbrunner - 1992 ACM DBLP
113 Output complexity of sorting and related problems (context) - Aggarwal, Vitter - 1988
113 Logic verification using binary decision diagrams in a logic.. (context) - Malik, Wang et al. - 1988
110 Fundamentals of Spatial Information Systems (context) - Laurini, Thompson - 1992
109 Multidimensional divide and conquer (context) - Bentley - 1980
107 External-memory graph algorithms - Chiang, Goodrich et al. - 1995 ACM DBLP
106 Priority search trees (context) - McCreight - 1985 DBLP
103 Indexing for data models with constraints and classes - Kanellakis, Ramaswamy et al. - 1993 ACM DBLP
92 The Design of Dynamic Data Structures (context) - Overmars - 1983
88 The hB-tree: A multiattribute indexing method with good guar.. (context) - Lomet, Salzberg - 1990
88 Data Structures and Algorithms 3: Multi-dimensional Searchin.. (context) - Mehlhorn - 1984
82 A model for hierarchical memory (context) - Aggarwal, Alpern et al. - 1987 ACM DBLP
82 Hierarchical memory with block transfer (context) - Aggarwal, Chandra et al. - 1987 DBLP
80 A new approach to rectangle intersections (context) - Edelsbrunner - 1983
80 A new approach to rectangle intersections (context) - Edelsbrunner - 1983
78 Handbook of Theoretical Computer Science (context) - van Leeuwen - 1990 ACM
75 Deterministic coin tossing with applications to optimal list.. (context) - Cole, Vishkin - 1986
67 A data structuring technique (context) - Chazelle, Guibas - 1986
67 A new data structure for representing sorted lists (context) - Huddleston, Mehlhorn - 1982
63 Dynamic algorithms in computational geometry - Chiang, Tamassia - 1992 ACM
62 Optimal dynamic interval management in external memory - Arge, Vitter - 1996 ACM
60 The buffer tree: A new technique for optimal I/O-algorithms (context) - Arge - 1995
60 Algorithms for bichromatic line-segment problems and polyhed.. (context) - Chazelle, Edelsbrunner et al. - 1994
59 Deterministic distribution sort in shared and distributed me.. (context) - Nodine, Vitter - 1993 ACM DBLP
57 Simple randomized mergesort on parallel disks - Barve, Grove et al. - 1996 ACM DBLP
54 complexity: The red-blue pebble game (context) - Hong, Kung - 1981
53 Path caching: A technique for optimal external searching - Ramaswamy, Subramanian - 1994 ACM DBLP
50 External-memory algorithms for processing line segments in g.. - Arge, Vengroff et al. - 1995
49 Virtual Memory for Data Parallel Computing (context) - Cormen - 1992 ACM
48 Triangulating simple polygons and equivalent problems (context) - Fournier, Montuno - 1984
48 Cascading divide-and-conquer: A technique for designing para.. (context) - Atallah, Cole et al. - 1989 ACM DBLP
48 range tree: A new data structure for range searching in seco.. (context) - Subramanian, Ramaswamy - 1995
42 Sun Microsystems Inc (context) - Cockcroft, Tuning et al. - 1995
41 Blocking for external graph searching - Nodine, Goodrich et al. - 1996 ACM DBLP
40 Computer Graphics: Principles and Practice (context) - Foley, van Dam et al. - 1990
40 Improved algorithms and data structures for solving graph pr.. - Kumar, Schwabe - 1996
38 Adding range restriction capability to dynamic data structur.. (context) - Willard, Lueker - 1985 ACM DBLP
38 Asymptotically tight bounds for performing BMMC permutations.. - Cormen, Sundquist et al. - 1994 ACM DBLP
38 Asymptotically tight bounds for performing BMMC permutations.. - Cormen, Wisniewski - 1993 ACM DBLP
37 Large-scale sorting in parallel memories (context) - Nodine, Vitter - 1991
37 Algorithms for klee's rectangle problems (context) - Bentley - 1977
35 Permuting information in idealized two-level storage (context) - Floyd - 1972
35 Uniform memory hierarchies (context) - Alpern, Carter et al. - 1990 DBLP
35 The design of the cell tree: An object-oriented index struct.. (context) - Gunther - 1989 DBLP
33 Fast permuting in disk arrays (context) - Cormen - 1993
33 A simple randomized parallel algorithm for list-ranking (context) - Anderson, Miller - 1990 ACM DBLP
33 Binary search tree of bounded balance (context) - Nievergelt, Reingold - 1973
33 An introduction through randomized algorithms (context) - Mulmuley - 1994
31 efficient scientific computation using TPIE (context) - Vengroff, Vitter et al. - 1995
31 Algorithms for parallel memory (context) - Vitter, Shriver - 1994
29 Dynamic point location in general subdivisions (context) - Baumgarten, Jung et al. - 1994 ACM DBLP
29 Batched dynamic solutions to decomposable searching problems (context) - Edelsbrunner, Overmars - 1985 DBLP
28 Breadth-first manipulation of very large binarydecision diag.. (context) - Ochi, Yasuoka et al. - 1993
27 Reporting and counting intersections between two sets of lin.. (context) - Mairson, Stolfi - 1988
26 efficiency of geometric algorithms: Distribution sweep vs (context) - Chiang, the - 1995
25 Efficient out-of-core algorithms for linear relaxation using.. - Leiserson, Rao et al. - 1993
25 An optimal worst case algorithm for reporting intersections .. (context) - Bentley, Wood - 1980 DBLP
24 complexity of ordered binary-decision diagram manipulation (context) - Arge, O- - 1995
24 Frontiers of feasible and probabilistic feasible boolean man.. - Gergov, Meinel - 1993 ACM DBLP
23 A fully-dynamic data structure for external substring search (context) - Ferragina, Grossi - 1995 ACM
23 Science of Computer Programming (context) - Misra, Gries et al. - 1982
23 Large-scale sorting in uniform memory hierarchies - Vitter, Nodine - 1993 ACM DBLP
22 range searching in external memory (context) - Vengroff, Vitter et al. - 1996
21 Optimal parallel sorting in multi-level storage - Aggarwal, Plaxton - 1994 ACM DBLP
21 Exploiting extensible dbms in integrated geographic informat.. (context) - Haas, Cody - 1991
21 Efficient breadth-first manipulation of binary decision diag.. (context) - Ashar, Cheong - 1994 ACM
20 Priority search trees in secondary memory (context) - Icking, Klein et al. - 1987 ACM
19 high-reliability storage subsystems (context) - Ganger, Worthington et al. - 1994
19 A simple trapezoid sweep algorithm for reporting red/blue se.. - Chan - 1994 DBLP
18 Paradigms for optimal sorting with multiple disks (context) - Nodine, Vitter - 1993
18 The Design and Analyses of Spatial Data Structures (context) - Samet - 1989
18 Efficient Algorithms for Computational Geometry and Graph Pr.. (context) - Chiang, O- - 1995
18 A transparent parallel I/O environment (context) - Vengroff - 1994
17 An intellegent information fusion system for handling the ar.. (context) - Cromp - 1993
17 the average number of rebalancing operations in weightbalanc.. (context) - Blum, Mehlhorn - 1980
16 Efficient suffix trees on secondary storage (context) - Clark, Munro - 1996
16 Memory paging for connectivity and path problems in graphs - Feuerstein, Marchetti-Spaccamela - 1993
16 Information Processing Letters (context) - Sieling, Wegener et al. - 1993
16 Counting and reporting red/blue segment intersections - Palazzi, Snoeyink - 1993 ACM DBLP
16 trees and their applications (context) - Callahan, Goodrich et al. - 1995
15 Annals of Mathematics and Artificial Intellegence (context) - Ullman, Yannakakis et al. - 1991
15 The TWA reservation system (context) - Gifford, Spector - 1984 ACM DBLP
15 Further comparisons of algorithms for geometric intersection.. - Andrews, Snoeyink et al. - 1994
15 Fast string searching in secondary storage: Theoretical deve.. (context) - Ferragina, Grossi - 1996 DBLP
14 Breadth-first manipulation of sbdd of boolean functions for .. (context) - Ochi, Ishiura et al. - 1991 ACM DBLP
14 XP-trees --- External priority search trees (context) - Blankenagel, Guting - 1990
13 A general lower bound on the I/O-complexity of comparison-ba.. (context) - Arge, Knudsen et al. - 1993 ACM DBLP
13 External segment trees (context) - Blankenagel, Guting - 1994 DBLP
12 Sorting and searching in multisets (context) - Munro, Spira - 1976 DBLP
12 Rectilinear line segment intersection (context) - Vaishnavi, Wood - 1982
12 Virtual memory algorithms (context) - Aggarwal, Chandra - 1988 ACM
11 Efficient memory access in large-scale computation (context) - Vitter - 1991 DBLP
10 Understanding GIS---the ARC/INFO method (context) - INFO - 1993
9 II: Hierarchical multilevel memories (context) - Vitter, Shriver et al. - 1994
9 sets representation and fast halfplane searching (context) - Franciosa, Talamo et al. - 1994
9 Guest Editor's Introduction in IEEE Computer (context) - Patt, subsystem et al. - 1994
8 The parallel hierarchical memory model - Juurlink, Wijshoff - 1993
7 Paging binary trees with external balancing (context) - Henrich, Six et al. - 1989
6 Dynamic Data Structures on Multiple Storage Media (context) - Smid - 1989
5 Maintaining range trees in secundary memory (context) - Overmars, Smid et al. - 1990
5 Technical Report RS (context) - Klarlund, Rauhe et al. - 1996
5 Maintaining range trees in secundary memory (context) - Smid, Overmars - 1990
5 Sorting multisets and vectors in-place (context) - Munro, Raman - 1991 DBLP
4 Space-time tradeoffs in memory hierarchies - Savage - 1993 ACM
4 OOBD indexing by class division (context) - Ramaswamy, Kanellakis - 1995
4 Packing trees - Gil, Itai - 1995
4 complexity of comparison and permutation problems (context) - Knudsen, Larsen et al. - 1992
3 Geographic information systems (context) - van Kreveld - 1995 ACM DBLP
3 Private communication (context) - Vengroff - 1996
3 Private communication (context) - Vengroff - 1995
2 the indivisibility assumption in the theory of externalmemor.. (context) - Arge, Miltersen
2 and CPU-optimal recorgnition of strongly connected component.. (context) - Jiang - 1993
2 Traversing graphs in a paging environment BFS or DFS (context) - Jiang - 1991
1 The human genome projekt: Past (context) - Watson - 1990
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mpi-sb.mpg.de/~crauser/papers.html): More
Optimal Dynamic Interval Management in External Memory - Arge, Vitter (1996) (Correct)
Blocking for External Graph Searching - Nodine (1996) (Correct)
Randomized External-Memory Algorithms for Some.. - Crauser, Ferragina, .. (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