The Computer Journal
Amortized efficiency of list update and paging rules
Communications of the ACM
A new polynomial-time algorithm for linear programming
Combinatorica
Abstraction and specification in program development
Abstraction and specification in program development
Software testing and evaluation
Software testing and evaluation
Exact computation of Steiner Minimal Trees in the plane
Information Processing Letters
Mathematical Programming: Series A and B
A rational design process: How and why to fake it
IEEE Transactions on Software Engineering
A sweepline algorithm for Voronoi diagrams
SCG '86 Proceedings of the second annual symposium on Computational geometry
An O(EV log V) algorithm for finding a maximal weighted matching in general graphs
SIAM Journal on Computing
A probabilistic analysis of the simplex method
A probabilistic analysis of the simplex method
Constructing test cases for partitioning heuristics
IEEE Transactions on Computers
Matching is as easy as matrix inversion
Combinatorica
The visual display of quantitative information
The visual display of quantitative information
Flocks, herds and schools: A distributed behavioral model
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Integer and combinatorial optimization
Integer and combinatorial optimization
A faster approximation algorithm for the Steiner problem in graphs
Information Processing Letters
The input/output complexity of sorting and related problems
Communications of the ACM
Verifiable implementation of geometric algorithms using finite precision arithmetic
Artificial Intelligence - Special issue on geometric reasoning
Tree clustering for constraint networks (research note)
Artificial Intelligence
Towards implementing robust geometric computations
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Epsilon geometry: building robust algorithms from imprecise computations
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
A code optimization package for REDUCE
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Evaluating Associativity in CPU Caches
IEEE Transactions on Computers
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
A geometric consistency theorem for a symbolic perturbation scheme
Journal of Computer and System Sciences
A bridging model for parallel computation
Communications of the ACM
A solid modelling system free from topological inconsistency
Journal of Information Processing
Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
A collection of test problems for constrained global optimization algorithms
A collection of test problems for constrained global optimization algorithms
Optimization
Using tolerances to guarantee valid polyhedral modeling results
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
On the complexity of test case generation for NP-hard problems
Information Processing Letters
Efficient Delaunay triangulation using rational arithmetic
ACM Transactions on Graphics (TOG)
Symbolic treatment of geometric degeneracies
Journal of Symbolic Computation
Fundamentals of software engineering
Fundamentals of software engineering
What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
Another view on parallel speedup
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
Guidelines for reporting results of computational experiments. Report of the ad hoc committee
Mathematical Programming: Series A and B
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Journal of Algorithms
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
ACM SIGARCH Computer Architecture News
A subexponential randomized simplex algorithm (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Analyzing algorithms by simulation: variance reduction techniques and simulation speedups
ACM Computing Surveys (CSUR)
An introduction to parallel algorithms
An introduction to parallel algorithms
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Algorithmic algebra
Efficient exact arithmetic for computational geometry
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Deterministic distribution sort in shared and distributed memory multiprocessors
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
An axiomatic approach to robust geometric programs
Journal of Symbolic Computation
On properties of floating point arithmetics: numerical stability and the cost of accurate computations
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
Direct bulk-synchronous parallel algorithms
Journal of Parallel and Distributed Computing
Design patterns: elements of reusable object-oriented software
Design patterns: elements of reusable object-oriented software
Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
The Steiner tree problem I: formulations, compositions and extension of facets
Mathematical Programming: Series A and B
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Designing programs that check their work
Journal of the ACM (JACM)
A General Approach to Removing Degeneracies
SIAM Journal on Computing
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Topology-oriented divide-and-conquer algorithm for Voronoi diagrams
Graphical Models and Image Processing
Randomized algorithms
Polyhedral modelling with exact arithmetic
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Finding Regular Simple Paths in Graph Databases
SIAM Journal on Computing
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Static analysis yields efficient exact integer arithmetic for computational geometry
ACM Transactions on Graphics (TOG)
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
Efficiently four-coloring planar graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Hierarchies of indices for text searching
Information Systems
LogP: a practical model of parallel computation
Communications of the ACM
A bridging model for parallel computation, communication, and I/O
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Range searching and point location among fat objects
Journal of Algorithms
Towards exact geometric computation
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Mesh refinement via bidirected flows: modeling, complexity, and computational results
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Software engineering with reusable components
Software engineering with reusable components
Object-oriented software construction (2nd ed.)
Object-oriented software construction (2nd ed.)
Parallel computation: models and methods
Parallel computation: models and methods
Introspective sorting and selection algorithms
Software—Practice & Experience
The Steiner tree packing problem in VLSI design
Mathematical Programming: Series A and B
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
Parallel algorithms column: on the search for suitable models
ACM SIGACT News
Efficient exact evaluation of signs of determinants
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Computing exact geometric predicates using modular arithmetic with single precision
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A perturbation scheme for spherical arrangements with application to molecular modeling
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Programming with POSIX threads
Programming with POSIX threads
Journal of Symbolic Computation - Special issue: validated numerical methods and computer algebra
LogGP: incorporating long messages into the LogP model for parallel computation
Journal of Parallel and Distributed Computing
Combinatorial optimization
Interval arithmetic yields efficient dynamic filters for computational geometry
Proceedings of the fourteenth annual symposium on Computational geometry
Recursion leads to automatic variable blocking for dense linear-algebra algorithms
IBM Journal of Research and Development
Models and languages for parallel computation
ACM Computing Surveys (CSUR)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
ESA '95 Selected papers from the third European symposium on Algorithms
Average-case computational complexity theory
Complexity theory retrospective II
Online computation and competitive analysis
Online computation and competitive analysis
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A quantitative comparison of parallel computation models
ACM Transactions on Computer Systems (TOCS)
Graph theory and its applications
Graph theory and its applications
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Empirical design of geometric algorithms
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient exact geometric computation made easy
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A core library for robust numeric and geometric computation
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
BSPlib: The BSP programming library
Parallel Computing
A fast and simple Steiner routing heuristic
Discrete Applied Mathematics - Special volume on VLSI
Exact computation of the sign of a finite sum
Applied Mathematics and Computation
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Efficient suffix trees on secondary storage
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The influence of caches on the performance of sorting
Journal of Algorithms
The influence of caches on the performance of sorting
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
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
On the bidirected cut relaxation for the metric Steiner tree problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial algorithms test sets CATS: the ACM/EATCS platform for experimental research
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Experiments on traveling salesman heuristics
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
Consistent calculations for solids modeling
SCG '85 Proceedings of the first annual symposium on Computational geometry
External memory algorithms
A survey of out-of-core algorithms in numerical linear algebra
External memory algorithms
Fundamental problems of algorithmic algebra
Fundamental problems of algorithmic algebra
Coarse grained parallel computing on heterogeneous systems
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Competitive analysis of randomized paging algorithms
Theoretical Computer Science
Validity of the single processor approach to achieving large scale computing capabilities
Readings in computer architecture
Practical segment intersection with finite precision output
Computational Geometry: Theory and Applications
\boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring
SIAM Journal on Computing
How to present a paper on experimental work with algorithms
ACM SIGACT News
Testing object-oriented systems: models, patterns, and tools
Testing object-oriented systems: models, patterns, and tools
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
A new heuristic for rectilinear Steiner trees
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Characteristics of scalability and their impact on performance
Proceedings of the 2nd international workshop on Software and performance
Parallel programming in OpenMP
Parallel programming in OpenMP
On the sorting-complexity of suffix tree construction
Journal of the ACM (JACM)
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
On Reporting Computational Experiments with Mathematical Software
ACM Transactions on Mathematical Software (TOMS)
Structured Programming with go to Statements
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
On the design of CGAL a computational geometry algorithms library
Software—Practice & Experience - Special issue on discrete algorithm engineering
An open graph visualization system and its applications to software engineering
Software—Practice & Experience - Special issue on discrete algorithm engineering
Implementing Quicksort programs
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
I/O-efficient algorithms for graphs of bounded treewidth
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A new constructive root bound for algebraic expressions
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Preferred direction Steiner trees
GLSVLSI '01 Proceedings of the 11th Great Lakes symposium on VLSI
A software engineering perspective on algorithmics
ACM Computing Surveys (CSUR)
Computational Geometry: Theory and Applications
Effective Java programming language guide
Effective Java programming language guide
User interface design for programmers
User interface design for programmers
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Improving memory performance of sorting algorithms
Journal of Experimental Algorithmics (JEA)
Implementing weighted b-matching algorithms: insights from a computational study
Journal of Experimental Algorithmics (JEA)
Dijkstra's algorithm on-line: an empirical case study from public railroad transport
Journal of Experimental Algorithmics (JEA)
Performance optimization of numerically intensive codes
Performance optimization of numerically intensive codes
Buffer insertion with adaptive blockage avoidance
Proceedings of the 2002 international symposium on Physical design
Cache-oblivious priority queue and graph algorithm applications
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Specifying Software
The C++ Programming Language
High Performance Cluster Computing: Programming and Applications
High Performance Cluster Computing: Programming and Applications
Models of Computation: Exploring the Power of Computing
Models of Computation: Exploring the Power of Computing
Improving Floating-Point Programming
Improving Floating-Point Programming
Handbook of Theoretical Computer Science
Handbook of Theoretical Computer Science
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A locality-preserving cache-oblivious dynamic dictionary
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Cache oblivious search trees via binary trees of small height
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
I/O-optimal algorithms for planar graphs using separators
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Algorithms and Architectures
Parallel Algorithms and Architectures
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Handbook on Parallel and Distributed Processing
Handbook on Parallel and Distributed Processing
C++ Standard Template Library
The CWEB System of Structured Documentation: Version 3.0
The CWEB System of Structured Documentation: Version 3.0
Network Flows and Matching: First DIMACS Implementation Challenge
Network Flows and Matching: First DIMACS Implementation Challenge
Distributed object location in a dynamic network
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A comparison of Steiner tree relaxations
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Improved algorithms for the Steiner problem in networks
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
An updated set of basic linear algebra subprograms (BLAS)
ACM Transactions on Mathematical Software (TOMS)
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
C++ Templates
Visualization of test information to assist fault localization
Proceedings of the 24th International Conference on Software Engineering
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Models for Parallel and Distributed Computation: Theory, Algorithmic Techniques, and Applications
Models for Parallel and Distributed Computation: Theory, Algorithmic Techniques, and Applications
Formal-Language-Constrained Path Problems
SIAM Journal on Computing
Journal of Automated Reasoning
Self-Organization in Biological Systems
Self-Organization in Biological Systems
Globally Distributed Content Delivery
IEEE Internet Computing
Out-Of-Core Rendering of Large, Unstructured Grids
IEEE Computer Graphics and Applications
Computer
Literate Programming Simplified
IEEE Software
Computational Geometry: Theory and Applications
Using PVS to validate the algorithms of an exact arithmetic
Theoretical Computer Science - Real numbers and computers
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Algorithm Design with Coarse-Grained Synchronization
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Optimal Dynamic Range Searching in Non-replicating Index Structures
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Algorithm Design and Software Libraries: Recent Developments in the LEDA Project
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
The Heterogeneous Bulk Synchronous Parallel Model
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Dynamic Storage Allocation: A Survey and Critical Review
IWMM '95 Proceedings of the International Workshop on Memory Management
From Algorithms to Working Programs: On the Use of Program Checking in LEDA
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
What Do We Learn from Experimental Algorithmics?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
Exponential Structures for Efficient Cache-Oblivious Algorithms
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Cache Oblivious Distribution Sweeping
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Complexity of Layered Binary Search Trees with Relaxed Balance
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Funnel Heap - A Cache Oblivious Priority Queue
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives
SIGAL '90 Proceedings of the International Symposium on Algorithms
The Nature and Meaning of Perturbations in Geometric Computing
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Submachine Locality in the Bulk Synchronous Setting (Extended Abstract)
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
A Case Study on the Cost of Geometric Computing
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Object-Oriented Design of Graph Oriented Data Structures
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Accessing the Internal Organization of Data Structures in the JDSL Library
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Using Multi-level Graphs for Timetable Information in Railway Systems
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Primal-dual approaches to the Steiner problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
ISCOPE '98 Proceedings of the Second International Symposium on Computing in Object-Oriented Parallel Environments
ISCOPE '98 Proceedings of the Second International Symposium on Computing in Object-Oriented Parallel Environments
Implementation an Experimental Evaluation of Graph Connectivity Algorithms Using LEDA
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport
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
Optimised Predecessor Data Structures for Internal Memory
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Pareto Shortest Paths is Often Feasible in Practice
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
CSPLIB: A Benchmark Library for Constraints
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Linear Size Binary Space Partitions for Fat Objects
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms
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
A Separation Bound for Real Algebraic Expressions
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th 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
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Design and Implementation of Efficient Data Types for Static Graphs
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
An Exact Algorithm for the Uniformly-Oriented Steiner Tree Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A Topology Oriented Algorithm for the Voronoi Diagram of Polygons
Proceedings of the 8th Canadian Conference on Computational Geometry
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
BSP-Like External-Memory Computation
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Architecture Independent Analysis of Parallel Programs
ICCS '01 Proceedings of the International Conference on Computational Science-Part II
An overview of the BlueGene/L Supercomputer
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
The Paderborn University BSP (PUB) library
Parallel Computing
Statistical Analysis of Computational Tests of Algorithms and Heuristics
INFORMS Journal on Computing
Solving Real-World Linear Programs: A Decade and More of Progress
Operations Research
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
I/O-efficient topological sorting of planar DAGs
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Cache-oblivious data structures for orthogonal range searching
Proceedings of the nineteenth annual symposium on Computational geometry
Constructive root bound for k-ary rational input numbers
Proceedings of the nineteenth annual symposium on Computational geometry
Controlled perturbation for arrangements of circles
Proceedings of the nineteenth annual symposium on Computational geometry
External memory data structures
Handbook of massive data sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Models of parallel computation: a survey and synthesis
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
PRO: A Model for Parallel Resource-Optimal Computation
HPCS '02 Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications
The Art of UNIX Programming
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Abstract State Machines: A Method for High-Level System Design and Analysis
Abstract State Machines: A Method for High-Level System Design and Analysis
Source Code Documentation: An Engineering Deliverable
TOOLS '00 Proceedings of the Technology of Object-Oriented Languages and Systems (TOOLS 34'00)
Algorithm engineering for parallel computation
Experimental algorithmics
Using finite experiments to study asymptotic performance
Experimental algorithmics
Presenting data from experiments in algorithmics
Experimental algorithmics
Distributed algorithm engineering
Experimental algorithmics
C# in a Nutshell
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Analysis of Multi-Dimensional Space-Filling Curves
Geoinformatica
The WEB system of structured documentation
The WEB system of structured documentation
Spanning trees in hypergraphs with applications to steiner trees
Spanning trees in hypergraphs with applications to steiner trees
Hierarchical levels of detail to accelerate the rendering of large static and dynamic polygonal environments
Automatic Generation of Staged Geometric Predicates
Higher-Order and Symbolic Computation
Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures
Journal of Experimental Algorithmics (JEA)
Efficient sorting using registers and caches
Journal of Experimental Algorithmics (JEA)
Modern Computer Algebra
Red-black trees in a functional setting
Journal of Functional Programming
New Year's Resolutions for Software Quality
IEEE Software
Probabilistic analysis of knapsack core algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Quasiconvex analysis of backtracking algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes Is in P"
Primality Testing in Polynomial Time: From Randomized Algorithms to "Primes Is in P"
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
Journal of the ACM (JACM)
Computer Organization and Design
Computer Organization and Design
Sensitivity Analysis in Practice: A Guide to Assessing Scientific Models
Sensitivity Analysis in Practice: A Guide to Assessing Scientific Models
Parallel Scientific Computation: A Structured Approach Using BSP and MPI
Parallel Scientific Computation: A Structured Approach Using BSP and MPI
The Priority R-tree: a practically efficient and worst-case optimal R-tree
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On the Streaming Model Augmented with a Sorting Primitive
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Random knapsack in expected polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Journal of Computer and System Sciences - Special issue: STOC 2003
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
Beyond the C++ Standard Library
Beyond the C++ Standard Library
Algorithm Design
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
Proceedings of the 2005 international symposium on Physical design
Space-efficient construction variants of dynamic programming
Nordic Journal of Computing
Shortest path amidst disc obstacles is computable
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Controlled perturbation for Delaunay triangulations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
Handbook of Parallel Computing and Statistics (Statistics, Textbooks and Monographs)
Handbook of Parallel Computing and Statistics (Statistics, Textbooks and Monographs)
Cache-Efficient Multigrid Algorithms
International Journal of High Performance Computing Applications
X10: an object-oriented approach to non-uniform cluster computing
OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Improved Smoothed Analysis of the Shadow Vertex Simplex Method
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The implementation of the BSP parallel computing model on the InteGrade Grid middleware
MGC '05 Proceedings of the 3rd international workshop on Middleware for grid computing
Geometric containers for efficient shortest-path computation
Journal of Experimental Algorithmics (JEA)
A computational study of external-memory BFS algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Trading off space for passes in graph streaming problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization
SIAM Journal on Computing
Highly scalable algorithms for rectilinear and octilinear Steiner trees
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
Computer algebra systems as mathematical optimizing compilers
Science of Computer Programming
A randomized polynomial-time simplex algorithm for linear programming
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A framework for modelling and analysis of software systems scalability
Proceedings of the 28th international conference on Software engineering
On the Greedy Superstring Conjecture
SIAM Journal on Discrete Mathematics
Reoptimization gaps versus model errors in online-dispatching of service units for ADAC
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Algorithmica
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
A Programmer's Companion to Algorithm Analysis
A Programmer's Companion to Algorithm Analysis
Combining speed-up techniques for shortest-path computations
Journal of Experimental Algorithmics (JEA)
Mesh Layouts for Block-Based Caches
IEEE Transactions on Visualization and Computer Graphics
Sequoia: programming the memory hierarchy
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
A memory model for scientific algorithms on graphics processors
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Sequoia: programming the memory hierarchy
Proceedings of the 2006 ACM/IEEE conference on Supercomputing
Parallel Processing for Scientific Computing (Software, Environments and Tools)
Parallel Processing for Scientific Computing (Software, Environments and Tools)
Software Engineering: (Update) (8th Edition) (International Computer Science)
Software Engineering: (Update) (8th Edition) (International Computer Science)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Efficient models for timetable information in public transportation systems
Journal of Experimental Algorithmics (JEA)
Principles of Constraint Programming
Principles of Constraint Programming
Structured programming
Selected Topics in Column Generation
Operations Research
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
How branch mispredictions affect quicksort
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Engineering highway hierarchies
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A PTAS for TSP with neighborhoods among fat regions in the plane
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A polynomial-time approximation scheme for Steiner tree in planar graphs
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Programmability and the Chapel Language
International Journal of High Performance Computing Applications
Foundations and Trends® in Theoretical Computer Science
The Number of Tree Stars Is O*(1.357k)
Algorithmica
Communications of the ACM
Managing data from high-throughput genomic processing: a case study
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Dynamic Programming for Minimum Steiner Trees
Theory of Computing Systems
An experimental study of random knapsack problems
Algorithmica
Handbook of Parallel Computing: Models, Algorithms and Applications (Chapman & Hall/Crc Computer & Information Science Series)
BSGP: bulk-synchronous GPU programming
ACM SIGGRAPH 2008 papers
STXXL: standard template library for XXL data sets
Software—Practice & Experience
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)
Using OpenMP: Portable Shared Memory Parallel Programming (Scientific and Engineering Computation)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Optimal speedup on a low-degree multi-core parallel architecture (LoPRAM)
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Fundamental parallel algorithms for private-cache chip multiprocessors
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Finite-resolution computational geometry
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Stable maintenance of point set triangulations in two dimensions
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Triangulating a simple polygon in linear time
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Safe and effective determinant evaluation
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Better external memory suffix array construction
Journal of Experimental Algorithmics (JEA)
Algorithms and Data Structures: The Basic Toolbox
Algorithms and Data Structures: The Basic Toolbox
The Algorithm Design Manual
Engineering multilevel overlay graphs for shortest-path queries
Journal of Experimental Algorithmics (JEA)
A pilot study to compare programming effort for two parallel programming models
Journal of Systems and Software
Why Greed Works for Shortest Common Superstring Problem
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A Bridging Model for Multi-core Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Intel threading building blocks
Intel threading building blocks
Accurate Floating-Point Summation Part I: Faithful Rounding
SIAM Journal on Scientific Computing
A unified model for multicore architectures
IFMT '08 Proceedings of the 1st international forum on Next-generation multicore/manycore technologies
Algorithms and Data Structures for External Memory
Algorithms and Data Structures for External Memory
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Handbook of Parametric and Nonparametric Statistical Procedures
Handbook of Parametric and Nonparametric Statistical Procedures
SHARC: Fast and robust unidirectional routing
Journal of Experimental Algorithmics (JEA)
Optimal in-place algorithms for 3-D convex hulls and 2-D segment intersection
Proceedings of the twenty-fifth annual symposium on Computational geometry
Parallel geometric algorithms for multi-core computers
Proceedings of the twenty-fifth annual symposium on Computational geometry
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Engineering Route Planning Algorithms
Algorithmics of Large and Complex Networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Simulated Annealing with Iterative Improvement
ICSPS '09 Proceedings of the 2009 International Conference on Signal Processing Systems
The Art of Computer Programming, Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams
Algorithm Engineering --- An Attempt at a Definition
Efficient Algorithms
Introduction to Algorithms, Third Edition
Introduction to Algorithms, Third Edition
Accurate Floating-Point Summation Part II: Sign, $K$-Fold Faithful and Rounding to Nearest
SIAM Journal on Scientific Computing
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Robust and Online Large-Scale Optimization
The greedy algorithm for shortest superstrings
Information Processing Letters
Why Programs Fail, Second Edition: A Guide to Systematic Debugging
Why Programs Fail, Second Edition: A Guide to Systematic Debugging
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Landmark-based routing in dynamic graphs
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
STAPL: an adaptive, generic parallel C++ library
LCPC'01 Proceedings of the 14th international conference on Languages and compilers for parallel computing
The parXXL environment: scalable fine grained development for large coarse grained platforms
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Broadword implementation of rank/select queries
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Characterizing the performance of flash memory storage devices and its impact on algorithm design
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Combining hierarchical and goal-directed speed-up techniques for Dijkstra's algorithm
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Contraction hierarchies: faster and simpler hierarchical routing in road networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Bidirectional A* search for time-dependent fast paths
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Multi-criteria shortest paths in time-dependent train networks
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Brainy: effective selection of data structures
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |