Complexity of network synchronization
Journal of the ACM (JACM)
IEEE Transactions on Computers - The MIT Press scientific computation series
Gap theorems for distributed computing
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
On the bit complexity of distributed computations in a ring with a leader
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
A new approach to the maximum flow problem
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing queries from tokens
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
A new graphy triconnectivity algorithm and its parallelization
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Transaction commitment at minimal communication cost
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
The construction of Huffman-equivalent prefix code in NC
ACM SIGACT News
Multilayered illiac network scheme
ACM SIGARCH Computer Architecture News
Establishing order in planar subdivisions
SCG '87 Proceedings of the third annual symposium on Computational geometry
A decomposable algorithm for contour surface display generation
ACM Transactions on Graphics (TOG)
A Rule Based Approach for Visual Pattern Inspection
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Distributed Algorithm for Fault Diagnosis in Systems with Soft Failures
IEEE Transactions on Computers
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Probabilistic inductive inference
Journal of the ACM (JACM)
Dynamic Testing Strategy for Distributed Systems
IEEE Transactions on Computers
An Efficient Distributed Protocol for Finding Shortest Paths in Networks with Negative Weights
IEEE Transactions on Software Engineering
Solving implication problems in database applications
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
On the correctness of representing extended entity-relationship structures in the relational model
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Constructing trees in parallel
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Computing Euclidean maximum spanning trees
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Worst-case delay estimation of transistor groups
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Processing Implication on Queries
IEEE Transactions on Software Engineering
A modular technique for the design of efficient distributed leader finding algorithms
ACM Transactions on Programming Languages and Systems (TOPLAS)
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
Compression, information theory, and grammars: a unified approach
ACM Transactions on Information Systems (TOIS)
Easily Testable Iterative Logic Arrays
IEEE Transactions on Computers
Unifying Maximum Cut and Minimum Cut of a Planar Graph
IEEE Transactions on Computers
On the existence of pseudorandom generators
CRYPTO '88 Proceedings on Advances in cryptology
Cost-sensitive analysis of communication protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Parallel Graph Algorithms Based Upon Broadcast Communications
IEEE Transactions on Computers
A randomized parallel algorithm for planar graph isomorphism
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A new placement level wirability estimate with measurements
ACM SIGDA Newsletter
Identifying Extended Entity-Relationship Object Structures in Relational Schemas
IEEE Transactions on Software Engineering
Removal of redundant dependences in DOACROSS loops with constant dependences
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
On upward drawing testing of triconnected digraphs (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Broadcast with partial knowledge (preliminary version)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
On the capabilities of systolic systems (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Improved Diagnosability Algorithms
IEEE Transactions on Computers
Hardware flooding (preliminary version)
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
The role of timing verification in layout synthesis
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
A data path layout assembler for high performance DSP circuits
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
IEEE Transactions on Computers
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Biconnectivity approximations and graph carvings
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Representing extended entity-relationship structures in relational databases: a modular approach
ACM Transactions on Database Systems (TODS)
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Minimum delay routing in stochastic networks
IEEE/ACM Transactions on Networking (TON)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Routability-driven fanout optimization
DAC '93 Proceedings of the 30th international Design Automation Conference
On the generation of minimal-length conformance tests for communication protocols
IEEE/ACM Transactions on Networking (TON)
A universal-scheme approach to statistical databases containing homogeneous summary tables
ACM Transactions on Database Systems (TODS)
Gibbs Random Fields, Cooccurrences, and Texture Modeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Highly parallelizable route planner based on cellular automata algorithms
IBM Journal of Research and Development
Efficient network flow based min-cut balanced partitioning
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
The virtual path layout problem in fast networks (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Journal of the ACM (JACM)
A versatile data structure for edge-oriented graph algorithms
Communications of the ACM
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
A fresh look at retiming via clock skew optimization
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
A shortest path approach to wireframe to solid model conversion
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Towards a high-level power estimation capability
ISLPED '95 Proceedings of the 1995 international symposium on Low power design
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
IEEE Transactions on Parallel and Distributed Systems
ACM Computing Surveys (CSUR)
Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
ACM Computing Surveys (CSUR)
Fast algorithms for k-shredders and k-node connectivity augmentation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Sizing of clock distribution networks for high performance CPU chips
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Topological design of local-area networks using genetic algorithms
IEEE/ACM Transactions on Networking (TON)
Logic optimization by output phase assignment in dynamic logic synthesis
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
A divide-and-conquer approach for asynchronous interface synthesis
ISSS '94 Proceedings of the 7th international symposium on High-level synthesis
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
Property testing in bounded degree graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A symbolic algorithm for maximum flow in 0-1 networks
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Data-flow assisted behavioral partitioning for embedded systems
DAC '97 Proceedings of the 34th annual Design Automation Conference
Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems
IEEE Transactions on Computers
Drawing planar partitions I: LL-drawings and LH-drawings
Proceedings of the fourteenth annual symposium on Computational geometry
A dynamically-directed switch model for MOS logic simulation
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Fast algorithm for optimal layer assignment
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A data structure for circuit net lists
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
Efficient support for client/server applications over heterogeneous ATM network
IEEE/ACM Transactions on Networking (TON)
An algorithm for clustering cDNAs for gene expression analysis
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Bit complexity of breaking and achieving symmetry in chains and rings (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
An efficient non-enumerative method to estimate path delay fault coverage
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Fast broadcast in high-speed networks
IEEE/ACM Transactions on Networking (TON)
The vertex-disjoint menger problem in planar graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
A representation for crossing set families with applications to submodular flow problems
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Energy-per-cycle estimation at RTL
ISLPED '99 Proceedings of the 1999 international symposium on Low power electronics and design
Perfect arborescence packing in preflow mincut graphs
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Stop minding your p's and q's: a simplified O(n) planar embedding algorithm
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Better random sampling algorithms for flows in undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
SAC '95 Proceedings of the 1995 ACM symposium on Applied computing
Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version)
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Using join operations as reducers in distributed query processing
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
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
Complexity Results for Permuting Data and Other Computations on Parallel Processors
Journal of the ACM (JACM)
A parallel algorithm for finding a maximum flow in 0-1 networks
CSC '87 Proceedings of the 15th annual conference on Computer Science
Performance evaluation of routing algorithms under various network configuration parameters
International Journal of Network Management
Efficient variants of Huffman codes in high level languages
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
Multicast tree construction and flooding in wireless ad hoc networks
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
A Fault Tolerant Technique for FPGAs
Journal of Electronic Testing: Theory and Applications
Solution Techniques for Constraint Satisfaction Problems: Advanced Approaches
Artificial Intelligence Review
Communication in the two-way listen-in vertex-disjoint paths mode
Theoretical Computer Science
Speeding up distributed simulation using the time warp mechanism
EW 2 Proceedings of the 2nd workshop on Making distributed systems work
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Labeling schemes for flow and connectivity
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On varying perspectives of problem decomposition
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
An architectural co-synthesis algorithm for distributed, embedded computing systems
Readings in hardware/software co-design
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence
Efficiently searching a graph by a smell-oriented vertex process
Annals of Mathematics and Artificial Intelligence
Vertex-Ant-Walk – A robust method for efficient exploration of faulty graphs
Annals of Mathematics and Artificial Intelligence
Constraints in Graph Drawing Algorithms
Constraints
Suppressing marginal totals from a two-dimensional table to protect sensitive information
Statistics and Computing
Algebric Decision Diagrams and Their Applications
Formal Methods in System Design
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
Reconfiguring One-Time Programmable FPGAs
IEEE Micro
Routing Strategies for Fast Networks
IEEE Transactions on Computers
FLEX: A Tolerant and Cooperative User Interface to Databases
IEEE Transactions on Knowledge and Data Engineering
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering
Removal of Redundant Dependences in DOACROSS Loops with Constant Dependences
IEEE Transactions on Parallel and Distributed Systems
Connective Fault Tolerance in Multiple-Bus Systems
IEEE Transactions on Parallel and Distributed Systems
A linear time special case for MC Games
Fundamenta Informaticae
Series-Parallel and Tree-Decomposition Approaches for Fuzzy Constraint Networks
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Approximation Algorithms for Survivable Optical Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Censoring Statistical Tables to Protect Sensitive Information: Easy and Hard Problems
SSDBM '96 Proceedings of the Eighth International Conference on Scientific and Statistical Database Management
Graph Transformation Modules and Their Composition
AGTIVE '99 Proceedings of the International Workshop on Applications of Graph Transformations with Industrial Relevance
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
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
Topology-Aware Algorithms for Large-Scale Communication
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
Optimal Fault-Tolerant Routings for k-Connected Graphs with Smaller Routing Tables
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Traversing Directed Eulerian Mazes
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Improving Static Compression Schemes by Alphabet Extension
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Restoration from Multiple Faults in WDM Networks without Wavelength Conversion
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Effective binary perspectives in algorithmic problem solving
Journal on Educational Resources in Computing (JERIC)
Farrell polynomials on graphs of bounded tree width
Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Property testing in massive graphs
Handbook of massive data sets
Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Characterizations of consistent marked graphs
Discrete Applied Mathematics - Special issue: The 1998 conference on ordinal and symbolic data analysis (OSDA '98)
Circuit clustering for delay minimization under area and pin constraints
EDTC '95 Proceedings of the 1995 European conference on Design and Test
Finding safe paths in a faulty environment
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Improved instruction formation in the exhaustive local microcode compaction algorithm
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Finding euler circuits in logarithmic parallel time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
An efficient network synchronization protocol
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A new look at fault tolerant network routing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Automated layout in ASHLAR: An approach to the problems of “General Cell” layout for VLSI
DAC '82 Proceedings of the 19th Design Automation Conference
Efficient reliable communication over partially authenticated networks
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Optimal Recovery Point Insertion for High-Level Synthesis of Recoverable Microarchitectures
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Automata logics, and infinite games
EURO-DAC '90 Proceedings of the conference on European design automation
TATOO: an industrial timing analyzer with false path elimination and test pattern generation
EURO-DAC '91 Proceedings of the conference on European design automation
Area and performance optimizations in path-based scheduling
EURO-DAC '91 Proceedings of the conference on European design automation
On the Guaranteed Throughput of Multizone Disks
IEEE Transactions on Computers
Energy and peak-current per-cycle estimation at RTL
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Handling syntactic constraints in a DTD-compliant XML editor
Proceedings of the 2003 ACM symposium on Document engineering
Distributed Diagnosis in Dynamic Fault Environments
IEEE Transactions on Parallel and Distributed Systems
The complexity of planarity testing
Information and Computation
Network flow for outlier detection
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
Traversal of an Unknown Directed Graph by a Finite Robot
Programming and Computing Software
On finding an ear decomposition of an undirected graph distributively
Information Processing Letters
Synchronization issues in protocol testing
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
On the use of registers in achieving wait-free consensus
Distributed Computing
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Encyclopedia of Computer Science
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Decomposing toroidal graphs into circuits and edges
Discrete Applied Mathematics
Digraph analysis of dictionary preposition definitions
WSD '02 Proceedings of the ACL-02 workshop on Word sense disambiguation: recent successes and future directions - Volume 8
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
Revisiting the ΔIC approach to component recovery
Science of Computer Programming - Software analysis, evolution and re-engineering
Efficient reliable communication over partially authenticated networks
Distributed Computing - Special issue: PODC 02
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
A note on rectilinear and polar visibility graphs
Discrete Applied Mathematics
Generation of relevance maps and navigation in a digital book
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Fast algorithms for robust classification with Bayesian nets
International Journal of Approximate Reasoning
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity
Information Processing Letters
An efficient packet scheduling algorithm with deadline guarantees for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Generalized structured programs and loop trees
Science of Computer Programming
Families of Fixed Degree Graphs for Processor Interconnection
IEEE Transactions on Computers
Heuristic Algorithms for Broadcasting in Point-to-Point Computer Networks
IEEE Transactions on Computers
Heartbeat based fault diagnosis for mobile ad-hoc network
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
A note on the construction of error detecting/correcting prefix codes
Information Processing Letters
Improved algorithms for graph four-connectivity
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Finding near optimal separators in planar graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Optimal maintenance of a spanning tree
Journal of the ACM (JACM)
A spatiotemporal data model for dynamic transit networks
International Journal of Geographical Information Science
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
Theoretical Computer Science
Outlier detection and evaluation by network flow
International Journal of Computer Applications in Technology
Semantic clustering for region-based image retrieval
Journal of Visual Communication and Image Representation
On private computation in incomplete networks
Distributed Computing
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Many-pairs mutual information for adding structure to belief propagation approximations
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
The anatomy of easy problems: a constraint-satisfaction formulation
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
The implementation of expert, knowledge-based systems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
On the space-time trade-off in solving constraint satisfaction problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
On the feasibility of distributed constraint satisfaction
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
A fault diagnosis algorithm for wireless sensor networks
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Parameter identification in a class of linear structural equation models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Application of Dynamic Programming to Solving K Postmen Chinese Postmen Problem
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Note: A note on rectilinear and polar visibility graphs
Discrete Applied Mathematics
Decomposing toroidal graphs into circuits and edges
Discrete Applied Mathematics
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
Labeling schemes for vertex connectivity
ACM Transactions on Algorithms (TALG)
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
A graph based backtracking algorithm for solving general CSPs
AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Cost minimisation in multi-interface networks
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Autonomous units and their semantics: the parallel case
WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Just-in-time monitoring of project activities through temporal reasoning
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Building steady-state simulators via hierarchical feedback decomposition
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Tree decomposition with applications to constraint processing
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Learning causal trees from dependence information
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Model decomposition and simulation: a component based qualitative simulation algorithm
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Using branch-and-bound with constraint satisfaction in optimization problems
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Fast detection and resolution of generalized distributed deadlocks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Some new techniques in waveshape capture and analysis
ITC'88 Proceedings of the 1988 international conference on Test: new frontiers in testing
Partially autonomous conceptual development of multifunctional structures
International Journal of Computer Applications in Technology
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Property testing
Introduction to testing graph properties
Studies in complexity and cryptography
Efficient approximation for triangulation of minimum treewidth
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Computational advantages of relevance reasoning in Bayesian belief networks
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Acyclic orientation of drawings
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
On embedding a cycle in a plane graph
GD'05 Proceedings of the 13th international conference on Graph Drawing
On a class of branching problems in broadcasting and distribution
Computers and Operations Research
European Journal of Combinatorics
Optimal seeding of self-reproducing systems
Artificial Life
Finding two disjoint paths in a network with normalized α+-MIN-SUM objective function
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Approximating the statistics of various properties in randomly weighted graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Auditing complex concepts of SNOMED using a refined hierarchical abstraction network
Journal of Biomedical Informatics
Clustering cycles into cycles of clusters
GD'04 Proceedings of the 12th international conference on Graph Drawing
Proof pearl: Dijkstra's shortest path algorithm verified with ACL2
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Planning the transportation of multiple commodities in bidirectional pipeline networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Structure-Based resilience metrics for service-oriented networks
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Heuristic algorithms for minimum bandwith consumption multicast routing in wireless mesh networks
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Approximating average parameters of graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Dinitz' algorithm: the original version and even's version
Theoretical Computer Science
On teaching fast adder designs: revisiting ladner & fischer
Theoretical Computer Science
Modeling and analysis of heterogeneous regulation in biological networks
RRG'04 Proceedings of the 2004 RECOMB international conference on Regulatory Genomics
Evader interdiction and collateral damage
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Bayesian learning for cardiac SPECT image interpretation
Artificial Intelligence in Medicine
Eulerian tour construction in a distributed environment
Computer Communications
Virtual path layout in ATM networks based on the P-median problem
Computer Communications
An algorithm for min-cost edge-disjoint cycles and its applications
Operations Research Letters
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
A simple version of Karzanov's blocking flow algorithm
Operations Research Letters
The k most vital arcs in the shortest path problem
Operations Research Letters
A Linear Time Special Case for MC Games
Fundamenta Informaticae
Labeling schemes for vertex connectivity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
A fast parallel algorithm for minimum-cost small integral flows
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
An overview of algorithms for network survivability
ISRN Communications and Networking
Independence entropy of Z^d-shift spaces
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
Decomposing a multigraph into split components
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
A simple 3-edge connected component algorithm revisited
Information Processing Letters
Topological morphing of planar graphs
Theoretical Computer Science
| Hi-index | 0.06 |