The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
An improved equivalence algorithm
Communications of the ACM
An algorithm for equivalence declarations
Communications of the ACM
Computing minimum spanning trees efficiently
ACM '72 Proceedings of the ACM annual conference - Volume 1
Testing flow graph reducibility
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On finding lowest common ancestors in trees
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Selected combinatorial research problems.
Selected combinatorial research problems.
Worst-case Analysis of Set Union Algorithms
Journal of the ACM (JACM)
Self-adjusting binary search trees
Journal of the ACM (JACM)
A compact row storage scheme for Cholesky factors using elimination trees
ACM Transactions on Mathematical Software (TOMS)
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
A linear algorithm for finding dominators in flow graphs and related problems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On the expected behavior of disjoint set union algorithms
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs
Journal of the ACM (JACM)
Unification problems with one-sided distributivity
Journal of Symbolic Computation
Fast algorithms for testing unsatisfiability of ground horn clauses with equations
Journal of Symbolic Computation
A note on relative neighborhood graphs
SCG '87 Proceedings of the third annual symposium on Computational geometry
New algorithms for comparing symbol sequences
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On the relationship of congruence closureand unification
Journal of Symbolic Computation
Optimal Three-Layer Channel Routing
IEEE Transactions on Computers
The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A decision procedure for conjunctive query disjointness
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Computing partial sums in multidimensional arrays
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Scheduling time-critical instructions on RISC machines
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Lower bounds for the union-find and the split-find problem on pointer machines
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
When trees collide: an approximation algorithm for the generalized Steiner problem on networks
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM (JACM)
A general approximation technique for constrained forest problems
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Primitives for asynchronous list compression
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Parallel Algorithms for Geometric Connected Component Labeling on a Hypercube Multiprocessor
IEEE Transactions on Computers
Parallel Architectures and Algorithms for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient accommodation of may-alias information in SSA form
PLDI '93 Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation
Scheduling time-critical instructions on RISC machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
Diversity-based inference of finite automata
Journal of the ACM (JACM)
Finding connected components on a scan line array processor
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Fast recognition of the nilpotency of permutation groups
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Efficient validity checking for processor verification
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Efficient detection of determinacy races in Cilk programs
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On the complexity of escape analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast interprocedural class analysis
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Worst-case and amortised optimality in union-find (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Increasing the weight of minimum spanning trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Decremental dynamic connectivity
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Faster and simpler algorithm for sorting signed permutations by reversals
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Path problems in skew-symmetric graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic algorithms for chordal graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
New techniques for the union-find problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
Lower Bounds for Selection in X + Y and Other Multisets
Journal of the ACM (JACM)
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Variations on the Common Subexpression Problem
Journal of the ACM (JACM)
An On-Line Edge-Deletion Problem
Journal of the ACM (JACM)
Inference of Reversible Languages
Journal of the ACM (JACM)
An Almost-Linear Algorithm for Two-Processor Scheduling
Journal of the ACM (JACM)
Design of Minimum-Cost Deadlock-Free Systems
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
A unified approach for solving bottleneck k-bipartition problems
CSC '91 Proceedings of the 19th annual conference on Computer Science
Near-optimal fully-dynamic graph connectivity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Word encoding tree connectivity works
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computing contour trees in all dimensions
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
An Implementation of Tarjan's Algorithm for the Block Triangularization of a Matrix
ACM Transactions on Mathematical Software (TOMS)
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Managing Reentrant Structures Using Reference Counts
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Automatic Technique for Selection of Data Representations in SETL Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An algorithm for reasoning about equality
Communications of the ACM
Encoding rectilinear Steiner trees as lists of edges
Proceedings of the 2001 ACM symposium on Applied computing
Using types to analyze and optimize object-oriented programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Scheduling time-constrained instructions on pipelined processors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Finding minimum congestion spanning trees
Journal of Experimental Algorithmics (JEA)
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A framework for call graph construction algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
Closed Partition Lattice and Machine Decomposition
IEEE Transactions on Computers - Special issue on fault-tolerant embedded systems
Meldable heaps and boolean union-find
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Symbolic program analysis in almost linear time
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Off-line and on-line algorithms for deducing equalities
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Symbolic evaluation and the global value graph
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A fast and usually linear algorithm for global flow analysis
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Type-Based Useless-Variable Elimination
Higher-Order and Symbolic Computation
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Automatic data structure selection in SETL
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Programming aspects of VLSI: (preliminary version)
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Comparison of Algorithms for Connected Set Openings and Closings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images
IEEE Transactions on Software Engineering
Computing contour trees in all dimensions
Computational Geometry: Theory and Applications - Fourth CGC workshop on computional geometry
Computing a threaded quadtree from the Delaunay triangulation in linear time
Nordic Journal of Computing
Entailment with Conditional Equality Constraints
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
MLDM '01 Proceedings of the Second International Workshop on Machine Learning and Data Mining in Pattern Recognition
Data Structures for Maintaining Set Partitions
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Distributed Searching of k-Dimensional Data with Almost Constant Costs
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
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Characterizing History Independent Data Structures
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Integrating Low Level Symmetries into Reachability Analysis
TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Finding the Most Vital Node of a Shortest Path
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Simple Generation of Static Single-Assignment Form
CC '00 Proceedings of the 9th International Conference on Compiler Construction
Maintaining a Minimum Spanning Tree Under Transient Node Failures
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Finding the most vital node of a shortest path
Theoretical Computer Science - Computing and combinatorics
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs
Theoretical Computer Science - Mathematical foundations of computer science
Incrementally solving functional constraints
Eighteenth national conference on Artificial intelligence
Molecular shape analysis based upon the morse-smale complex and the connolly function
Proceedings of the nineteenth annual symposium on Computational geometry
Linear-time connected-component labeling based on sequential local operations
Computer Vision and Image Understanding
Dynamic orthogonal range queries in OLAP
Theoretical Computer Science - Database theory
High Similarity Sequence Comparison in Clustering Large Sequence Databases
CSB '02 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Space-time tradeoff for answering range queries (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A data structure for dynamic trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Reference machines require non-linear time to maintain disjoint sets
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On the average behavior of set merging algorithms (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Network flow and generalized path compression
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Computing integrated costs of sequences of operations with application to dictionaries
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Linear expected-time algorithms for connectivity problems (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Efficient octree conversion by connectivity labeling
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
Fast expected-time and approximation algorithms for geometric minimum spanning trees
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Superconcentrators, generalizers and generalized connectors with limited depth
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A linear-time algorithm for a special case of disjoint set union
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A parallel algorithm for k-minimum spanning trees
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Salembier's Min-tree algorithm turned into breadth first search
Information Processing Letters
Identifying Terminal Distinguishable Languages
Annals of Mathematics and Artificial Intelligence
A linear-time component-labeling algorithm using contour tracing technique
Computer Vision and Image Understanding
ACL '82 Proceedings of the 20th annual meeting on Association for Computational Linguistics
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Applications of Forman's Discrete Morse Theory to Topology Visualization and Mesh Compression
IEEE Transactions on Visualization and Computer Graphics
Data structures for maintaining set partitions
Random Structures & Algorithms
Simple and optimal output-sensitive construction of contour trees using monotone paths
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Simplify: a theorem prover for program checking
Journal of the ACM (JACM)
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A truthful mechanism for the non-utilitarian minimum radius spanning tree problem
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Type inference, principal typings, and let-polymorphism for first-class mixin modules
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Information and Computation
Small hop-diameter sparse spanners for doubling metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Finding 3-shredders efficiently
ACM Transactions on Algorithms (TALG)
Finding equilibria in large sequential games of imperfect information
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
I/O-efficient batched union-find and its applications to terrain analysis
Proceedings of the twenty-second annual symposium on Computational geometry
Dynamic consistency checking for temporal and spatial relations in multimedia presentations
Proceedings of the 2006 ACM symposium on Applied computing
Smarter garbage collection with simplifiers
Proceedings of the 2006 workshop on Memory system performance and correctness
ACM Transactions on Algorithms (TALG)
Pyramid segmentation algorithms revisited
Pattern Recognition
A note on data structures for maintaining bipartitions
Journal of Discrete Algorithms
Hybrid object labelling in digital images
Machine Vision and Applications
Fast congruence closure and extensions
Information and Computation
Procedure placement using temporal-ordering information: Dealing with code size expansion
Journal of Embedded Computing - Cache exploitation in embedded systems
ACM Transactions on Algorithms (TALG)
Making context-sensitive points-to analysis with heap cloning practical for the real world
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
New constructions for provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 12th ACM symposium on Access control models and technologies
Dynamic test input generation for database applications
Proceedings of the 2007 international symposium on Software testing and analysis
Lossless abstraction of imperfect information games
Journal of the ACM (JACM)
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
Theoretical Computer Science
Improving Compilation of Java Scientific Applications
International Journal of High Performance Computing Applications
Path constraints in semistructured data
Theoretical Computer Science
A persistent union-find data structure
ML '07 Proceedings of the 2007 workshop on Workshop on ML
Some Observations on Equivalence Handling Methods
IEEE Transactions on Computers
Content-Addressable Read/Write Memories for Image Analysis
IEEE Transactions on Computers
Equivalence between priority queues and sorting
Journal of the ACM (JACM)
Topological model for 3D image representation: Definition and incremental extraction algorithm
Computer Vision and Image Understanding
Splay trees, Davenport-Schinzel sequences, and the deque conjecture
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Using bisimulation proof techniques for the analysis of distributed abstract machines
Theoretical Computer Science
Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation
ACM Transactions on Software Engineering and Methodology (TOSEM)
Efficient nondestructive equality checking for trees and graphs
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
An efficient parallel approach for identifying protein families in large-scale metagenomic data sets
Proceedings of the 2008 ACM/IEEE conference on Supercomputing
The "Not-Too-Heavy Spanning Tree" Constraint
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Combining Proof-Producing Decision Procedures
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
New constructions for provably-secure time-bound hierarchical key assignment schemes
Theoretical Computer Science
Parallel Algorithm for Concurrent Computation of Connected Component Tree
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Testing bipartiteness of geometric intersection graphs
ACM Transactions on Algorithms (TALG)
Swoosh: a generic approach to entity resolution
The VLDB Journal — The International Journal on Very Large Data Bases
Fast connected-component labeling
Pattern Recognition
Processing an Offline Insertion-Query Sequence with Applications
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
A Compact Representation for Syntactic Dependencies in QBFs
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Automated deduction for verification
ACM Computing Surveys (CSUR)
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
Computational Geometry: Theory and Applications
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
Electronic Notes in Theoretical Computer Science (ENTCS)
An algorithm for reasoning about equality
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 1
Maintaining arc consistency using adaptive domain ordering
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Simple and optimal output-sensitive construction of contour trees using monotone paths
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Combination of convex theories: Modularity, deduction completeness, and explanation
Journal of Symbolic Computation
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
A scalable decision procedure for fixed-width bit-vectors
Proceedings of the 2009 International Conference on Computer-Aided Design
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
An art gallery-based approach: roadmap construction and path planning in global environments
International Journal of Robotics and Automation
Optimal MST maintenance for transient deletion of every node in planar graphs
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Construction of combinatorial pyramids
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Classification automaton and its construction using learning
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
How to swap a failing edge of a single source shortest paths tree
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Scaling Java points-to analysis using SPARK
CC'03 Proceedings of the 12th international conference on Compiler construction
Salient regions from scale-space trees
SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
The construction of bounded irregular pyramids with a union-find decimation process
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
A tutorial on satisfiability modulo theories
CAV'07 Proceedings of the 19th international conference on Computer aided verification
First results for 3D image segmentation with topological map
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Computing homology generators for volumes using minimal generalized maps
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Comparison of local and global region merging in the topological map
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Evolutionary Rough Parallel Multi-Objective Optimization Algorithm
Fundamenta Informaticae
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms
Comparing unification algorithms in first-order theorem proving
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
A fast connected components labeling algorithm and its application to real-time pupil detection
Machine Vision and Applications - Integrated Imaging and Vision Techniques for Industrial Inspection
I/O-efficient batched union-find and its applications to terrain analysis
ACM Transactions on Algorithms (TALG)
Parallel inclusion-based points-to analysis
Proceedings of the ACM international conference on Object oriented programming systems languages and applications
Efficient computation of new extinction values from extended component tree
Pattern Recognition Letters
Data structures for range minimum queries in multidimensional arrays
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Applications of forbidden 0-1 matrices to search tree and path compression-based data structures
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
A Systolic Design for Connectivity Problems
IEEE Transactions on Computers
Data structures for mergeable trees
ACM Transactions on Algorithms (TALG)
Note: A simple and efficient Union-Find-Delete algorithm
Theoretical Computer Science
Linear time analysis of properties of conflict-free and general Petri nets
Theoretical Computer Science
Source-level support for timing analysis
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part II
A sharp concentration-based adaptive segmentation algorithm
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
A linear algorithm for MLL proof net correctness and sequentialization
Theoretical Computer Science
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Cycle elimination for invocation graph-based context-sensitive pointer analysis
Information and Software Technology
Don't rush into a union: take time to find your roots
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Abstract machines for safe ambients in wide-area and mobile networks
COORDINATION'11 Proceedings of the 13th international conference on Coordination models and languages
Incremental algorithm for hierarchical minimum spanning forests and saliency of watershed cuts
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Foot contact detection for sprint training
ACCV'10 Proceedings of the 2010 international conference on Computer vision - Volume Part I
Boolean equi-propagation for optimized SAT encoding
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
ACM Transactions on Algorithms (TALG)
Origins of Nonlinearity in Davenport-Schinzel Sequences
SIAM Journal on Discrete Mathematics
Spectral Sparsification of Graphs
SIAM Journal on Computing
The minimum spanning tree constraint
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Computing homology for surfaces with generalized maps: application to 3d images
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Probabilistic ontologies and relational databases
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Union-find with constant time deletions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
The early bird gets the buzz: detecting anomalies and emerging trends in information networks
Proceedings of the fifth ACM international conference on Web search and data mining
Experiments on union-find algorithms for the disjoint-set data structure
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Interactive point-and-click segmentation for object removal in digital images
ICCV'05 Proceedings of the 2005 international conference on Computer Vision in Human-Computer Interaction
An optimal-time construction of sparse Euclidean spanners with tiny diameter
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
A correct abstract machine for safe ambients
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Proof-producing congruence closure
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
The weighted spanning tree constraint revisited
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A coherent logic based geometry theorem prover capable of producing formal and readable proofs
ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
On the probabilistic min spanning tree Problem
Journal of Mathematical Modelling and Algorithms
Recent developments in the theory of data structures
Computer Languages
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Finding a feasible flow in a strongly connected network
Operations Research Letters
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree
Operations Research Letters
Research paper: The saga of minimum spanning trees
Computer Science Review
Max-coloring paths: tight bounds and extensions
Journal of Combinatorial Optimization
Automated and efficient analysis of role-based access control with attributes
DBSec'12 Proceedings of the 26th Annual IFIP WG 11.3 conference on Data and Applications Security and Privacy
Sparse fault-tolerant spanners for doubling metrics with bounded hop-diameter or degree
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Dominators, directed bipolar orders, and independent spanning trees
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Data-parallel mesh connected components labeling and analysis
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
approximate range searching: the absolute model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
An experimental study of dynamic dominators
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Efficient data race detection for async-finish parallelism
Formal Methods in System Design
Sharp bounds on Davenport-Schinzel sequences of every order
Proceedings of the twenty-ninth annual symposium on Computational geometry
Parameterized complexity of discrete morse theory
Proceedings of the twenty-ninth annual symposium on Computational geometry
Leveraging transitive relations for crowdsourced joins
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
ACSC '12 Proceedings of the Thirty-fifth Australasian Computer Science Conference - Volume 122
Sparse Euclidean Spanners with Tiny Diameter
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
Rangoli: space management in deduplication environments
Proceedings of the 6th International Systems and Storage Conference
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research
We know how you live: exploring the spectrum of urban lifestyles
Proceedings of the first ACM conference on Online social networks
Modular reasoning about heap paths via effectively propositional formulas
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Finding dominators via disjoint set union
Journal of Discrete Algorithms
Equistable simplicial, very well-covered, and line graphs
Discrete Applied Mathematics
Sampling from repairs of conditional functional dependency violations
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.04 |