Optimal attack and reinforcement of a network
Journal of the ACM (JACM)
Self-adjusting binary search trees
Journal of the ACM (JACM)
A locally adaptive data compression scheme
Communications of the ACM
Planar point location using persistent search trees
Communications of the ACM
IEEE Transactions on Computers - The MIT Press scientific computation series
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)
Generating editing environments based on relations and attributes
ACM Transactions on Programming Languages and Systems (TOPLAS)
Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Making data structures persistent
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Rotation distance, triangulations, and hyperbolic geometry
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
IEEE Transactions on Computers
A public key cryptosystem based on the word problem
Proceedings of CRYPTO 84 on Advances in cryptology
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
Multicommodity flows in planar undirected graphs and shortest paths
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
An efficient algorithm for the “optimal” stable marriage
Journal of the ACM (JACM)
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A note on relative neighborhood graphs
SCG '87 Proceedings of the third annual symposium on Computational geometry
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Linearity and unprovability of set union problem
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Finding minimum-cost circulations by canceling negative cycles
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Understanding and verifying distributed algorithms using stratified decomposition
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Multidimensional Balanced Binary Trees
IEEE Transactions on Computers
An efficient two-dimensional layout compaction algorithm
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Labeled trees and the efficient computation of derivations
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
Finding minimum-cost circulations by canceling negative cycles
Journal of the ACM (JACM)
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
The maximum concurrent flow problem
Journal of the ACM (JACM)
The Ballast Methodology for Structured Partial Scan Design
IEEE Transactions on Computers
A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
INC: a language for incremental computations
ACM Transactions on Programming Languages and Systems (TOPLAS)
A matroid approach to finding edge connectivity and packing arborescences
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Wait-free parallel algorithms for the union-find problem
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Transitions in geometric minimum spanning trees (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Performance-driven system partitioning on multi-chip modules
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Uncoupling updating and rebalancing in chromatic binary search trees
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Improved Diagnosability Algorithms
IEEE Transactions on Computers
A Network Flow Approach to the Reconfiguration of VLSI Arrays
IEEE Transactions on Computers
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
An O(n1.5logn) 1-d compaction algorithm
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
On minimal closure constraint generation for symbolic cell assembly
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Fully persistent lists with catenation
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Offline maintenance of planar configurations
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Planar geometric location problems and maintaining the width of a planar set
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
Algorithms for subset testing and finding maximal sets
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
On the parallel implementation of Goldberg's maximum flow algorithm
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Global tagging optimization by type inference
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Automatic partitioning of a program dependence graph into parallel tasks
IBM Journal of Research and Development
A parallel algorithm for computing minimum spanning trees
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Minkowski-type theorems and least-squares partitioning
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Optimally profiling and tracing programs
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
High speed switch scheduling for local area networks
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
A hierarchical single-key-lock access control using the Chinese remainder theorem
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Sparse dynamic programming II: convex and concave cost functions
Journal of the ACM (JACM)
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
A Polynomial Algorithm for Balancing Acyclic Data Flow Graphs
IEEE Transactions on Computers
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Splaying a search tree in preorder takes linear time
ACM SIGACT News
Retrieval from hierarchical texts by partial patterns
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
Dynamic ray shooting and shortest paths via balanced geodesic triangulations
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
A fast multilayer general area router for MCM designs
EURO-DAC '92 Proceedings of the conference on European design automation
MSTC: a method for identifying overconstraints during hierarchical compaction
DAC '93 Proceedings of the 30th international Design Automation Conference
An implementation of the &egr;-relaxation algorithm on the CM-5
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Learning &mgr;-branching programs with queries
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Union-copy structures and dynamic segment trees
Journal of the ACM (JACM)
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Biased finger trees and three-dimensional layers of maxima: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Optimally profiling and tracing programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fully persistent lists with catenation
Journal of the ACM (JACM)
Compression-relaxation: a new approach to performance driven placement for regular architectures
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Iterative algorithms for formal verification of embedded real-time systems
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
A timing analysis algorithm for circuits with level-sensitive latches
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Bounds and error estimates for radiosity
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A randomized linear-time algorithm for finding minimum spanning trees
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Random sampling in cut, flow, and network design problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
An Automaton Model for Scheduling Constraints in Synchronous Machines
IEEE Transactions on Computers
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
Optimal Reconfiguration Algorithms for Real-Time Fault-Tolerant Processor Arrays
IEEE Transactions on Parallel and Distributed Systems
Fundamental ideas for a parallel computing course
ACM Computing Surveys (CSUR)
An O(n2(m + Nlog n)log n) min-cost flow algorithm
Journal of the ACM (JACM)
Efficient recompression techniques for dynamic full-text retrieval systems
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Triangulations intersect nicely
Proceedings of the eleventh annual symposium on Computational geometry
Fast distributed construction of k-dominating sets and applications
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
An optimal algorithm for area minimization of slicing floorplans
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Short length versions of Menger's theorem
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Solving satisfiability and implication problems in database systems
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A new approach to the minimum cut problem
Journal of the ACM (JACM)
Environmental acquisition: a new inheritance-like abstraction mechanism
Proceedings of the 11th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Automatic reconstruction of B-spline surfaces of arbitrary topological type
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Finding minimum spanning forests in logarithmic time and linear work using random sampling
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Program decomposition for pointer aliasing: a step toward practical analyses
SIGSOFT '96 Proceedings of the 4th ACM SIGSOFT symposium on Foundations of software engineering
Achieving Full Parallelism Using Multidimensional Retiming
IEEE Transactions on Parallel and Distributed Systems
Interchangeable pin routing with application to package layout
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Generation of synthetic sequential benchmark circuits
FPGA '97 Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays
Using random sampling to find maximum flows in uncapacitated undirected graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Nesting of reducible and irreducible loops
ACM Transactions on Programming Languages and Systems (TOPLAS)
A data front-end for layered manufacturing
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient breakout routing in printed circuit boards
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the analysis of indexing schemes
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fast and accurate flow-insensitive points-to analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
High level reading and data structure compilation
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Computers
The supplemental proceedings of the conference on Integrating technology into computer science education: working group reports and supplemental proceedings
Edge profiling versus path profiling: the showdown
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Semantics and verification of action diagrams with linear timing
ACM Transactions on Design Automation of Electronic Systems (TODAES)
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
Simplicial maps for progressive transmission of polygonal surfaces
Proceedings of the third symposium on Virtual reality modeling language
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Historical perspectives on the computing curriculum
ACM SIGCUE Outlook - Special issue: ITiCSE '97 working group papers
A unified approach to labeling graphical features
Proceedings of the fourteenth annual symposium on Computational geometry
A new method for modeling and solving the protein fold recognition problem (extended abstract)
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
An iterative approach for rules and data allocation in distributed deductive database systems
Proceedings of the seventh international conference on Information and knowledge management
Beyond the flow decomposition barrier
Journal of the ACM (JACM)
Aggregate structure identification and its application to program analysis
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient and flexible incremental parsing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Greeding matching algorithms, an experimental study
Journal of Experimental Algorithmics (JEA)
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Unique maximum matching algorithms
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The string B-tree: a new data structure for string search in external memory and its applications
Journal of the ACM (JACM)
Group updates for relaxed height-balanced trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Minimizing time-space cost for database version control
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Confluently persistent deques via data structuaral bootstrapping
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Average case analysis of dynamic graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Scaling algorithms for the shortest paths problem
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An O(log*n) approximation algorithm for the asymmetric p-center problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Worst-case efficient priority queues
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
The complexity of flat origami
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Efficient and practical modular decomposition
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Methods for achieving fast query times in point location data structures
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Approximating the minimum equivalent digraph
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Approximate data structures with applications
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
An optimal RAM implementation of catenable min double-ended queues
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Efficient algorithms for Petersen's matching theorem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the parallel time complexity of undirected connectivity and minimum spanning trees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Shortest paths algorithms: theory and experimental evaluation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Faster deterministic sorting and priority queues in linear space
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Identifying loops in almost linear time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Skip strips: maintaining triangle strips for view-dependent rendering
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Maintenance of a minimum spanning forest in a dynamic planar graph
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Incremental algorithms for minimal length paths
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New results on server problems
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On the number of minimum size separating vertex sets in a graph and how to find all of them
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Determining the evolutionary tree
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
On solving large maximum concurrent flow problems
CSC '87 Proceedings of the 15th annual conference on Computer Science
On preorder splaying in binary search trees(abstract and references only)
CSC '91 Proceedings of the 19th annual conference on Computer Science
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Which pointer analysis should I use?
Proceedings of the 2000 ACM SIGSOFT international symposium on Software testing and analysis
Unification-based pointer analysis with directional assignments
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Off-line variable substitution for scaling points-to analysis
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
Correspondence-based data structures for double-ended priority queues
Journal of Experimental Algorithmics (JEA)
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
IEEE Transactions on Computers
On the stability of input-queued switches with speed-up
IEEE/ACM Transactions on Networking (TON)
Simplified kinetic connectivity for rectangles and hypercubes
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Faster kinetic heaps and their use in broadcast scheduling
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficiency by Incrementalization: An Introduction
Higher-Order and Symbolic Computation
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
Proceedings of the sixth ACM symposium on Solid modeling and applications
Compiler optimization of dynamic data distributions for distributed-memory multicomputers
Compiler optimizations for scalable parallel systems
ACM SIGACT News
Combinatorial auctions with decreasing marginal utilities
Proceedings of the 3rd ACM conference on Electronic Commerce
Theoretical Computer Science
The price of anarchy is independent of the network topology
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Remote attribute updating for language-based editors
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Global array reference allocation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Motorcycle graphs and straight skeletons
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The freeze-tag problem: how to wake up a swarm of robots
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Construction of probe interval models
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Exploiting flexibly assignable work to improve load balance
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On loops, dominators, and dominance frontiers
ACM Transactions on Programming Languages and Systems (TOPLAS)
Packet-mode scheduling in input-queued cell-based switches
IEEE/ACM Transactions on Networking (TON)
Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas
Annals of Mathematics and Artificial Intelligence
Binding-time analysis for both static and dynamic expressions
New Generation Computing - Partial evaluation and program transformation
Spanning-tree based coverage of continuous areas by a mobile robot
Annals of Mathematics and Artificial Intelligence
Reducing the Complexity of Robot‘s Scene for Faster Collision Detection
Journal of Intelligent and Robotic Systems
Bus optimization for low-power data path synthesis based on network flow method
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
An integrated data path optimization for low power based on network flow method
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
A note on practical construction of maximum bandwidth paths
Information Processing Letters
Port partitioning and dynamic queueing for IP Forwarding
Computers and Operations Research
In Order to Form a More Perfect UNION
Computing in Science and Engineering
A Framework for Streaming Geometry in VRML
IEEE Computer Graphics and Applications
Tiny Tera: A Packet Switch Core
IEEE Micro
IEEE Transactions on Computers
An Optimal Graph-Construction Approach to Placing Program Signatures for Signature Monitoring
IEEE Transactions on Computers
An Improved Algorithm for Implication Testing Involving Arithmetic Inequalities
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
A Network Flow Model for Load Balancing in Circuit-Switched Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Detecting Corrupted Pages in M Replicated Large Files
IEEE Transactions on Parallel and Distributed Systems
Scheduling Data-Flow Graphs via Retiming and Unfolding
IEEE Transactions on Parallel and Distributed Systems
Finding paths in graphs avoiding forbidden transitions
Discrete Applied Mathematics
Access Control Protocols for Interconnected WDM Rings in the DAVID Metro Network
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
Out-of-Core Functional Programming with Type-Based Primitives
PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Placing Probes along the Genome Using Pairwise Distance Data
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Maintenance of a Percing Set for Intervals with Applications
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
New Results on the k-Truck Problem
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
A Multicast FCFS Output Queued Switch without Speedup
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Binding-Time Analysis for Both Static and Dynamic Expressions
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Coping with Inconsistent Constraint Specifications
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
A Global Constraint Combining a Sum Constraint and Difference Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A Placement Algorithm for FPGA Designs with Multiple I/O Standards
FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Transformational Derivation of Greedy Network Algorithms from Descriptive Specifications
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
A Scable Video-on-Demand Server for a Dynamic Heterogeneous Environment
MIS '98 Proceedings of the 4th International Workshop on Advances in Multimedia Information Systems
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Cycles in Generalized Networks
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Using Symbolic Computation in an Automated Sequent Derivation System for Multi-valued Logic
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
A parallel: distributed approach to the analysis of complex waveguide circuits
Practical parallel computing
Selected topics on assignment problems
Discrete Applied Mathematics
Exact and approximate methods for data directed microaggregation in one or more dimensions
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Fuzzy-connected 3D image segmentation at interactive speeds
Graphical Models
MST construction in O(log log n) communication rounds
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Planar minimally rigid graphs and pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry
Molecular shape analysis based upon the morse-smale complex and the connolly function
Proceedings of the nineteenth annual symposium on Computational geometry
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Interactive authoring of multimedia documents in a constraint-based authoring system
Multimedia Systems - Special section on video libraries
Optimizing synchronous systems for multi-dimensional applications
EDTC '95 Proceedings of the 1995 European conference on Design and Test
A hybrid hierarchical approach for multi-layer global routing
EDTC '95 Proceedings of the 1995 European conference on Design and Test
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Bounds on delays and queue lengths in input-queued cell switches
Journal of the ACM (JACM)
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Parallel algorithms for unification and other complete problems in p
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
The verification System by Dense Timing Constraints and Probabilitie
SEEP '96 Proceedings of the 1996 International Conference on Software Engineering: Education and Practice (SE:EP '96)
Reducing Test Application Time in High-Level Test Generation
ITC '00 Proceedings of the 2000 IEEE International Test Conference
A Scalable and Efficient Methodology to Extract Two Node Bridges from Large Industrial Circuits
ITC '00 Proceedings of the 2000 IEEE International Test Conference
An optimal PRAM algorithm for a spanning tree on trapezoid graphs
The Korean Journal of Computational & Applied Mathematics
High-level synthesis for low power based on network flow method
IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on the 2001 international conference on computer design (ICCD)
Think globally, fit locally: unsupervised learning of low dimensional manifolds
The Journal of Machine Learning Research
Optimal discrete Morse functions for 2-manifolds
Computational Geometry: Theory and Applications
A global router for sea-of-gates circuits
EURO-DAC '91 Proceedings of the conference on European design automation
Algorithm to extract two-node bridges
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Narratives of space and time: visualization for distributed applications
CASCON '91 Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research
Challenges in graph-based relational data visualization
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1
The price of anarchy is independent of the network topology
Journal of Computer and System Sciences - STOC 2002
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Making data structures confluently persistent
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Extreme elevation on a 2-manifold
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
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
An NC algorithm for finding a maximal acyclic set in a graph
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A Fast Crosstalk- and Performance-Driven Multilevel Routing System
Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
Minimal length test vectors for multiple-fault detection
Theoretical Computer Science - Mathematical foundations of programming semantics
Work-conserving distributed schedulers for Terabit routers
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Distributed scheduling policies in networks of input-queued packet switches
ACM SIGCOMM Computer Communication Review
On Optimal Placement of Intrusion Detection Modules in Sensor Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
On external-memory MST, SSSP and multi-way planar graph separation
Journal of Algorithms
A self-stabilizing algorithm for the maximum flow problem
Distributed Computing
The effect of post-layout pin permutation on timing
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
Broad-phase collision detection using semi-adjusting BSP-trees
Proceedings of the 2005 symposium on Interactive 3D graphics and games
Quasi-Linear Algorithms for the Topological Watershed
Journal of Mathematical Imaging and Vision
Approximation algorithms for combinatorial auctions with complement-free bidders
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Partitioning of Web graphs by community topology
WWW '05 Proceedings of the 14th international conference on World Wide Web
Computers and Operations Research
Computing the shortest path: A search meets graph theory
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An O(VE) algorithm for ear decompositions of matching-covered graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
A linear-time approximation algorithm for weighted matchings in graphs
ACM Transactions on Algorithms (TALG)
Client assignment in content dissemination networks for dynamic data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Expanding Neighborhood GRASP for the Traveling Salesman Problem
Computational Optimization and Applications
Improving Load Balance with Flexibly Assignable Tasks
IEEE Transactions on Parallel and Distributed Systems
Pipelined two step iterative matching algorithms for CIOQ crossbar switches
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
An O(VE) algorithm for ear decompositions of matching-covered graphs
ACM Transactions on Algorithms (TALG)
O(log log n)-competitive dynamic binary search trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Design of data structures for mergeable trees
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On graph problems in a semi-streaming model
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A Bayesian approach to diagram matching with application to architectural models
Proceedings of the 28th international conference on Software engineering
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Heuristic shortest path algorithms for transportation applications: state of the art
Computers and Operations Research
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
On the severity of Braess's paradox: designing networks for selfish users is hard
Journal of Computer and System Sciences - Special issue on FOCS 2001
Hardware Efficient Two Step Iterative Matching Algorithms for VOQ Switches
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
On-line maintenance of simplified weighted graphs for efficient distance queries
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Localized asynchronous packet scheduling for buffered crossbar switches
Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Algorithm-Hardware Codesign of Fast Parallel Round-Robin Arbiters
IEEE Transactions on Parallel and Distributed Systems
Three problems about simple polygons
Computational Geometry: Theory and Applications
ACM Transactions on Algorithms (TALG)
Cross-layer adaptive techniques for throughput enhancement in wireless OFDM-based networks
IEEE/ACM Transactions on Networking (TON)
An improved earliness-tardiness timing algorithm
Computers and Operations Research
On labeling in graph visualization
Information Sciences: an International Journal
Role classification of hosts within enterprise networks based on connection patterns
ATEC '03 Proceedings of the annual conference on USENIX Annual Technical Conference
A Zero-Space algorithm for Negative Cost Cycle Detection in networks
Journal of Discrete Algorithms
Improved shortest path algorithms for nearly acyclic directed graphs
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Interconnect and communication synthesis for distributed register-file microarchitecture
Proceedings of the 44th annual Design Automation Conference
Some approximation algorithms for the clique partition problem in weighted interval graphs
Theoretical Computer Science
Optimal per-edge processing times in the semi-streaming model
Information Processing Letters
On packing and coloring hyperedges in a cycle
Discrete Applied Mathematics
Multiple source shortest paths in a genus g graph
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Multiple choice tries and distributed hash tables
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
An improved algorithm to accelerate regular expression evaluation
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
ACM Transactions on Algorithms (TALG)
Computing large matchings fast
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Combinatorial Theory Series B
An algorithm for ranking assignments using reoptimization
Computers and Operations Research
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Hierarchical memory with block transfer
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Efficient projections onto the l1-ball for learning in high dimensions
Proceedings of the 25th international conference on Machine learning
Approximate labelled subtree homeomorphism
Journal of Discrete Algorithms
Point-to-Point Shortest Path Algorithms with Preprocessing
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
A Comparative Evaluation of XML Difference Algorithms with Genomic Data
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
ACM Transactions on Algorithms (TALG)
From generic to specific: off-line optimization for a general constraint solver
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
On redundancy, efficiency, and robustness in coverage for multiple robots
Robotics and Autonomous Systems
Paths and trails in edge-colored graphs
Theoretical Computer Science
Combinatorial optimization: mutual relations among graph algorithms
WSEAS Transactions on Mathematics
A Scalable Inclusion Constraint Solver Using Unification
Logic-Based Program Synthesis and Transformation
A nearly linear time algorithm for the half integral parity disjoint paths packing problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A new constrained edit distance between quotiented ordered trees
Journal of Discrete Algorithms
Computing the arrangement of circles on a sphere, with applications in structural biology
Computational Geometry: Theory and Applications
Input-sensitive scalable continuous join query processing
ACM Transactions on Database Systems (TODS)
Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Shortest Path and Maximum Flow Problems in Networks with Additive Losses and Gains
FAW '09 Proceedings of the 3d International Workshop on Frontiers in Algorithmics
Journal of Experimental Algorithmics (JEA)
Properly Coloured Cycles and Paths: Results and Open Problems
Graph Theory, Computational Intelligence and Thought
Conspiracy numbers and caching for searching and/or trees and theorem-proving
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
The symmetric alldiff constraint
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Three problems about simple polygons
Computational Geometry: Theory and Applications
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry: Theory and Applications - Special issue on the 19th annual symposium on computational geometry - SoCG 2003
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Perfect Matching for Biconnected Cubic Graphs in O(n log2n) Time
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Path problems in generalized stars, complete graphs, and brick wall graphs
Discrete Applied Mathematics - Special issue: Efficient algorithms
Information Processing Letters
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
A scheduling algorithm for minimizing the packet error probability in clusterized TDMA networks
EURASIP Journal on Wireless Communications and Networking - Special issue on optimization techniques in wireless communications
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
An implicit representation of chordal comparability graphs in linear time
Discrete Applied Mathematics
Search data structures for skewed strings
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Characterization of type hierarchies with open specification
Proceedings of the 2nd international conference on Semantics in databases
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Hit-list worm detection and bot identification in large networks using protocol graphs
RAID'07 Proceedings of the 10th international conference on Recent advances in intrusion detection
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Paths and trails in edge-colored graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Parallelization of bulk operations for STL dictionaries
Euro-Par'07 Proceedings of the 2007 conference on Parallel processing
Proceedings of the forty-second ACM symposium on Theory of computing
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
A kinetic triangulation scheme for moving points in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Enumeration of the perfect sequences of a chordal graph
Theoretical Computer Science
Computing large matchings fast
ACM Transactions on Algorithms (TALG)
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Highway dimension, shortest paths, and provably efficient algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Faster algorithms for semi-matching problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Fréchet distance of surfaces: some simple hard cases
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Theory of communication networks
Algorithms and theory of computation handbook
Algorithm design and analysis techniques
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Revisiting the voronoi description of protein-protein interfaces: algorithms
PRIB'10 Proceedings of the 5th IAPR international conference on Pattern recognition in bioinformatics
Fréchet distance with speed limits
Computational Geometry: Theory and Applications
Generalized arc consistency for global cardinality constraint
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
An algorithm for calculating the similarity measures of surfaces represented as point clouds
Pattern Recognition and Image Analysis
Shortest path and maximum flow problems in networks with additive losses and gains
Theoretical Computer Science
The extended global cardinality constraint: An empirical survey
Artificial Intelligence
A kinetic triangulation scheme for moving points in the plane
Computational Geometry: Theory and Applications
Position heaps: A simple and dynamic text indexing data structure
Journal of Discrete Algorithms
Constant density displays using diversity sampling
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
A simpler algorithm and shorter proof for the graph minor decomposition
Proceedings of the forty-third annual ACM symposium on Theory of computing
Computing large matchings in planar graphs with fixed minimum degree
Theoretical Computer Science
An empirical evaluation of extendible arrays
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
The least-core of threshold network flow games
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Efficiently approximating Markov tree bagging for high-dimensional density estimation
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Recommendation systems with complex constraints: A course recommendation perspective
ACM Transactions on Information Systems (TOIS)
Fast and flexible unsupervised custering algorithm based on ultrametric properties
Proceedings of the 7th ACM symposium on QoS and security for wireless and mobile networks
Exact algorithms for OWA-optimization in multiobjective spanning tree problems
Computers and Operations Research
PRIB'11 Proceedings of the 6th IAPR international conference on Pattern recognition in bioinformatics
Hierarchical BOA, cluster exact approximation, and ising spin glasses
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
An implicit representation of chordal comparabilty graphs in linear-time
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On packing and coloring hyperedges in a cycle
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Simple distributed algorithms for approximating minimum steiner trees
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Specific-Purpose web searches on the basis of structure and contents
Proceedings of the 2005 international conference on Federation over the Web
Link discovery in graphs derived from biological databases
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
Minimum clique partition problem with constrained weight for interval graphs
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Parallel computing of catchment basins in large digital elevation model
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Combination of among and cardinality constraints
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Random access to grammar-compressed strings
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The disjoint paths problem in quadratic time
Journal of Combinatorial Theory Series B
Scalable parallel minimum spanning forest computation
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
An efficient algorithm for finding maximum cycle packings in reducible flow graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Poketree: a dynamically competitive data structure with good worst-case performance
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Polyphonic alignment algorithms for symbolic music retrieval
CMMR/ICAD'09 Proceedings of the 6th international conference on Auditory Display
Kinetic euclidean minimum spanning tree in the plane
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Research: Synchronizable test sequence generation using UIO sequences
Computer Communications
Mechanism design for double auctions with temporal constraints
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Finding the K shortest hyperpaths using reoptimization
Operations Research Letters
Optimal Web cache sizing: scalable methods for exact solutions
Computer Communications
An application of limited branching in clustering
Pattern Recognition Letters
Inferring most likely queue length from transactional data
Operations Research Letters
An O(n log n) algorithm for the convex bipartite matching problem
Operations Research Letters
A sequential dual simplex algorithm for the linear assignment problem
Operations Research Letters
Layered interval codes for TCAM-based classification
Computer Networks: The International Journal of Computer and Telecommunications Networking
Kinetic Euclidean minimum spanning tree in the plane
Journal of Discrete Algorithms
The weak-heap data structure: Variants and applications
Journal of Discrete Algorithms
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
A more reliable greedy heuristic for maximum matchings in sparse random graphs
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Dynamizing succinct tree representations
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Reliable collective communications with weighted SRLGs in optical networks
IEEE/ACM Transactions on Networking (TON)
The Watershed Transform: Definitions, Algorithms and Parallelization Strategies
Fundamenta Informaticae
A M2MC based approach for mapping two ADL models
Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Multi-server generalized processor sharing
Proceedings of the 24th International Teletraffic Congress
Controller and estimator for dynamic networks
Information and Computation
Efficient data race detection for async-finish parallelism
Formal Methods in System Design
We know how you live: exploring the spectrum of urban lifestyles
Proceedings of the first ACM conference on Online social networks
Customizable point-of-interest queries in road networks
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Finding dominators via disjoint set union
Journal of Discrete Algorithms
| Hi-index | 0.11 |