Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control
Parallel ear decomposition search (EDS) and st-numbering in graphs
Theoretical Computer Science
The input/output complexity of sorting and related problems
Communications of the ACM
A simple randomized parallel algorithm for list-ranking
Information Processing Letters
Recursive star-tree parallel data-structure
Recursive star-tree parallel data-structure
Optimal cooperative search in fractional cascaded data structures
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Blocking for external graph searching
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of Parallel and Distributed Computing - Special issue on parallel I/O systems
Virtual memory for data-parallel computing
Virtual memory for data-parallel computing
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
A randomized linear-time algorithm for finding minimum spanning trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Global min-cuts in RNC, and other ramifications of a simple min-out algorithm
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient parallel algorithms for some graph problems
Communications of the ACM
Memory Paging for Connectivity and Path Problems in Graphs
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Further Computational Geometry in Secondary Memory
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Orders, k-sets and Fast Halfplane Search on Paged Memory
ORDAL '94 Proceedings of the International Workshop on Orders, Algorithms, and Applications
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
Asymptotically Tight Bounds for Performing BMMC Permutations on Parallel Disk Systems
A fully-dynamic data structure for external substring search
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Perspectives on database theory
ACM SIGACT News
Structured permuting in place on parallel disk systems
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Communication issues in large-scale geometric computation
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Strategic directions in storage I/O issues in large-scale computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
I/O-efficient algorithms and environments
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On sorting strings in external memory (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
I/O optimal isosurface extraction (extended abstract)
VIS '97 Proceedings of the 8th conference on Visualization '97
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Blocking in parallel multisearch problems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
A simple and efficient parallel disk mergesort
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
I/O-efficient algorithms for contour-line extraction and planar graph blocking
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A multi-threaded streaming pipeline architecture for large structured data sets
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
A fuzzy approach to automatic data locality optimization
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
ACM Computing Surveys (CSUR)
Towards a theory of cache-efficient algorithms
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Fast concurrent access to parallel disks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On external memory graph traversal
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
I/O-efficient algorithms for graphs of bounded treewidth
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
An experimental study of priority queues in external memory
Journal of Experimental Algorithmics (JEA)
Cache-oblivious priority queue and graph algorithm applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
I/O-optimal algorithms for planar graphs using separators
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Heuristics for semi-external depth first search on directed graphs
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
I/O-efficient techniques for computing pagerank
Proceedings of the eleventh international conference on Information and knowledge management
Out-of-core rendering of massive geometric environments
Proceedings of the conference on Visualization '02
Towards a theory of cache-efficient algorithms
Journal of the ACM (JACM)
An external memory data structure for shortest path queries
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
I/O-Efficient Shortest Path Queries in Geometric Spanners
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
On External-Memory Planar Depth First Search
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Finding Generalized Path Patterns for Web Log Data Mining
ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Fully Dynamic Clustering of Metric Data Sets
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
External Memory Algorithms for Outerplanar Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
An Experimental Study of Priority Queues in External Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
LEDA-SM Extending LEDA to Secondary Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A Functional Approach to External Graph Algorithms
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
I/O-Efficient Well-Separated Pair Decomposition and Its Applications
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
External-Memory Breadth-First Search with Sublinear I/O
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
I/O-efficient topological sorting of planar DAGs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
External memory data structures
Handbook of massive data sets
Handbook of massive data sets
Distributed Computing with Load-Managed Active Storage
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
The Link Database: Fast Access to Graphs of the Web
DCC '02 Proceedings of the Data Compression Conference
Compressing the Graph Structure of the Web
DCC '01 Proceedings of the Data Compression Conference
I/O-Efficient Algorithms for Problems on Grid-Based Terrains
Journal of Experimental Algorithmics (JEA)
Cache-oblivious shortest paths in graphs using buffer heap
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Journal of Experimental Algorithmics (JEA)
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Lower bounds for external algebraic decision trees
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
Proceedings of the 2006 ACM symposium on Applied computing
Translating submachine locality into locality of reference
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Divide and conquer approach for efficient pagerank computation
ICWE '06 Proceedings of the 6th international conference on Web engineering
An external-memory depth-first search algorithm for general grid graphs
Theoretical Computer Science
I/O-efficient undirected shortest paths with unbounded edge lengths
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Seeking stable clusters in the blogosphere
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
TerraStream: from elevation data to watershed hierarchies
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Terracost: Computing least-cost-path surfaces for massive grid terrains
Journal of Experimental Algorithmics (JEA)
I/o-efficient efficient algorithms for computing contours on a terrain
Proceedings of the twenty-fourth annual symposium on Computational geometry
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Semi-external LTL Model Checking
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
On Trade-Offs in External-Memory Diameter-Approximation
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Cache-Oblivious Red-Blue Line Segment Intersection
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
External memory layout vs. schematic
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Graph-based methods for the analysis of large-scale multiagent systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Assembling approximately optimal binary search trees efficiently using arithmetics
Information Processing Letters
A Heuristic Strong Connectivity Algorithm for Large Graphs
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry: Theory and Applications
I/O-Efficient Contour Tree Simplification
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
External-memory depth-first search algorithm for solid grid graphs
Information Processing Letters
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
An external memory data structure for shortest path queries (extended abstract)
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
I/O efficient accepting cycle detection
CAV'07 Proceedings of the 19th international conference on Computer aided verification
I/O-efficient map overlay and point location in low-density subdivisions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Performance guarantees for B-trees with different-sized atomic keys
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Low depth cache-oblivious algorithms
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
I/O-efficient computation of water flow across a terrain
Proceedings of the twenty-sixth annual symposium on Computational geometry
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Theoretical Computer Science
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
External-memory algorithms and data structures
Algorithms and theory of computation handbook
Fast PGAS Implementation of Distributed Graph Algorithms
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Lossless fault-tolerant data structures with additive overhead
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Clustering nodes in large-scale biological networks using external memory algorithms
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part II
I/O-Efficiently pruning dense spanners
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Cache-oblivious planar shortest paths
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Lightweight data indexing and compression in external memory
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
External data structures for shortest path queries on planar digraphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
I/O-efficient contour queries on terrains
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
I/O-Efficient algorithms on near-planar graphs
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Large-Scale directed model checking LTL
SPIN'06 Proceedings of the 13th international conference on Model Checking Software
Efficient external-memory bisimulation on DAGs
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms (TALG)
A topological sorting algorithm for large graphs
Journal of Experimental Algorithmics (JEA)
External Memory Algorithms for String Problems
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
GraphChi: large-scale graph computation on just a PC
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Adapting parallel algorithms to the W-stream model, with applications to graph problems
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
I/O-Efficient flow modeling on fat terrains
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Techniques for designing efficient parallel graph algorithms for SMPs and multicore processors
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Cache and I/O efficent functional algorithms
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
I/O efficient: computing SCCs in massive graphs
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
A space efficient streaming algorithm for triangle counting using the birthday paradox
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
On (dynamic) range minimum queries in external memory
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Efficient parallel and external matching
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |