Searching for authors named "Lars Arge" – sorted by Relevance.
70 documents found, showing 1 through 10.
Next 10 →
-
M 3
- …• Modern machines have complicated memory hierarchy…
- Add To MetaCart
-
External Memory Geometric Data Structures
- ……
- Cited by 1 (0 self) – Add To MetaCart
-
I/O-efficient strong connectivity and depth-first search for directed planar graphs
- …We present the first I/O-efficient algorithms for the following fundamental problems on directed planar graphs: finding the strongly connected components, finding a simple-path 2 3-separator, and computing a depth-first span-ning (DFS) tree. Our algorithms for the first two problems perform O(sort(N…
- Cited by 3 (3 self) – Add To MetaCart
-
Efficient External-Memory Data Structures and Applications
- …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-effic…
- Cited by 39 (12 self) – Add To MetaCart
-
External Memory Data Structures
- …In many massive dataset applications the data must be stored in space and query efficient data structures on external storage devices. Often the data needs to be changed dynamically. In this chapter we discuss recent advances in the development of provably worst-case efficient external memory dynami…
- Cited by 62 (31 self) – Add To MetaCart
-
External-Memory Algorithms with Applications in Geographic Information Systems
- …In the design of algorithms for large-scale applications it is essential to consider the problem of minimizing Input/Output (I/O) communication. Geographical information systems (GIS) are good examples of such large-scale applications as they frequently handle huge amounts of spatial data. In this n…
- Cited by 24 (9 self) – Add To MetaCart
-
The I/O-Complexity of Ordered Binary-Decision Diagram Manipulation
- …Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. OBDDs have been successfully used to solve problems in e.g. digital-systems design, verification and testing, in math…
- Cited by 29 (17 self) – Add To MetaCart
-
The buffer tree: A new technique for optimal I/O-algorithms
- … …
- Cited by 144 (27 self) – Add To MetaCart
-
External Geometric Data Structures (Invited paper)
- …Many modern applications store and process datasets much larger than the main memory of even state-of-the-art high-end machines. Thus massive and dynamically changing datasets often need to be stored in space efficient data structures on external storage devices such as disks, and in such cases the …
- Add To MetaCart
-
I/O-Efficient Dynamic Planar Point Location
- …We present the first provably I/O-efficient dynamic data structure for point location in a general planar subdivision. Our structure uses O(N/B) disk blocks to store a subdivision of size N , where B is the disk block size. Queries can be answered in ... I/Os in the worst-case, and insertions and de…
- Cited by 27 (16 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
