A New Method of Checking the Consistency of Precedence Matrices
Journal of the ACM (JACM)
Information-flow and data-flow analysis of while-programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Computing Surveys (CSUR)
A new approach to all pairs shortest paths in planar graphs
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Optimal Systolic Design for the Transitive Closure and the Shortest Path Problems
IEEE Transactions on Computers
A study of transitive closure as a recursion mechanism
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A DAG clustering algorithm for design configurations
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
A Systolic Array for the Assignment Problem
IEEE Transactions on Computers
Broadcast Normalization in Systolic Design
IEEE Transactions on Computers
Multiprocessor transitive closure algorithms
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Direct transitive closure algorithms: design and performance evaluation
ACM Transactions on Database Systems (TODS)
The input/output complexity of transitive closure
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
New techniques for best-match retrieval
ACM Transactions on Information Systems (TOIS)
Look ma, no hashing, and no arrays neither
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
Mixed-approach algorithms for transitive closure (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs
Pattern Recognition Letters
Design of Optimal Systolic Algorithms for the Transitive Closure Problem
IEEE Transactions on Computers
On tree-based techniques for query evaluation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Avoiding unconditional jumps by code replication
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Transitive closure algorithms based on graph traversal
ACM Transactions on Database Systems (TODS)
Compiling machine-independent parallel programs
ACM SIGPLAN Notices
A performance study of transitive closure algorithms
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
A Modular Systolic Linearization of the Warshall-Floyd Algorithm
IEEE Transactions on Parallel and Distributed Systems
Path queries for transportation networks: dynamic reordering and sliding window paging techniques
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Graph-theoretic methods in database theory
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A generalized transitive closure for relational queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Combinatorial approximation algorithms for generalized flow problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the Boolean Matrix Equation M′=∨i=1Mi
Journal of the ACM (JACM)
An Algorithm for Finding a Minimum Equivalent Graph of a Digraph
Journal of the ACM (JACM)
Journal of the ACM (JACM)
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
Journal of the ACM (JACM)
A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph
Journal of the ACM (JACM)
Scheduling Tasks with Nonuniform Deadlines on Two Processors
Journal of the ACM (JACM)
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Lower Bounds for Selection in X + Y and Other Multisets
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
Graph Problems on a Mesh-Connected Processor Array
Journal of the ACM (JACM)
A Survey of Some Theoretical Aspects of Multiprocessing
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Computer-assisted microanalysis of programs
Communications of the ACM
A improvement to Martin's algorithm for computation of linear precedence functions
Communications of the ACM
A modification of Warshall's algorithm for the transitive closure of binary relations
Communications of the ACM
The parallel execution of DO loops
Communications of the ACM
A Boolean matrix method for the computation of linear precedence functions
Communications of the ACM
Immediate predominators in a directed graph [H]
Communications of the ACM
An efficient data structure for dynamic memory management
Journal of Systems and Software
A new method for determining linear precedence functions for precedence grammars
Communications of the ACM
Mechanical languages: a course specification
Communications of the ACM
Programming Languages: Boolean matrix methods for the detection of simple precedence grammars
Communications of the ACM
On the relative efficiencies of context-free grammar
Communications of the ACM
Techniques for Selective Revalidation
IEEE Software
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
IEEE Transactions on Knowledge and Data Engineering
3-D Object Recognition with Symmetric Models: Symmetry Extraction and Encoding
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Processor-Time-Minimal Systolic Array for Transitive Closure
IEEE Transactions on Parallel and Distributed Systems
Efficient transitive closure reasoning in a combined class/part/containment hierarchy
Knowledge and Information Systems
Graphs and enhancing Maple multiplication
Mathematics and Computer Education
Semiring frameworks and algorithms for shortest-distance problems
Journal of Automata, Languages and Combinatorics
Introducing Context-Based Constraints
FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
A Parallel Transitive Closure Computation Algorithm for VLSI Test Generation
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Direct Algorithms for Computing the Transitive Closure of Database Relations
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Efficient Transitive Closure Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Query Processing for Distance Metrics
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Hybrid Transitive Closure Algorithms
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Proceedings of the 13th International Symposium on Distributed Computing
Event-State Duality: The Enriched Case
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Generic epsilon -Removal Algorithm for Weighted Automata
CIAA '00 Revised Papers from the 5th International Conference on Implementation and Application of Automata
An introduction to processor-time-optimal systolic arrays
Highly parallel computaions
Interface Timing Verification with Delay Correlation Using Constraint Logic Programming
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Graph problems on a mesh-connected processor array (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Computer-aided micro-analysis of programs
ICSE '79 Proceedings of the 4th international conference on Software engineering
Requirements expression and verification aid
ICSE '78 Proceedings of the 3rd international conference on Software engineering
On line context free language recognition in less than cubic time(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Compile time syntax analysis of APL programs
APL '81 Proceedings of the international conference on APL
A survey of compiler optimization techniques
ACM '73 Proceedings of the ACM annual conference
A heuristic teleprocessing network design technique
ANSS '76 Proceedings of the 4th symposium on Simulation of computer systems
A methodology for decomposing system requirements into data processing requirements
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Removal of invariant statements from nested-loops in a single effective compiler pass
Proceedings of the conference on Programming languages and compilers for parallel and vector machines
Setting the foundations of computer science in a business oriented program
SIGCSE '75 Proceedings of the fifth SIGCSE technical symposium on Computer science education
Information Dissemination in Partitionable Mobile Ad Hoc Networks
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Confirming Configurations in EFSM Testing
IEEE Transactions on Software Engineering
What can we gain by unfolding loops?
ACM SIGPLAN Notices
A note on the transitive closure of a boolean matrix
ACM SIGACT News
Semirings in operations research and computer science: more algebra
Fundamenta Informaticae
Yin Yang bipolar logic and bipolar fuzzy logic
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Efficient Relational Calculation for Software Analysis
IEEE Transactions on Software Engineering
Worst-case update times for fully-dynamic all-pairs shortest paths
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Computing transitive closure on systolic arrays of fixed size
Distributed Computing
Thick 2D relations for document understanding
Information Sciences—Informatics and Computer Science: An International Journal
Leakage power optimization with dual-Vth library in high-level synthesis
Proceedings of the 42nd annual Design Automation Conference
Detecting causal relationships in distributed computations: in search of the holy grail
Distributed Computing
Shortest-Path Kernels on Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Multiobjective Satisfaction within an Interactive Evolutionary Design Environment
Evolutionary Computation
Cache-oblivious dynamic programming
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Generating all vertices of a polyhedron is hard
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
An anytime symmetry detection algorithm for ROBDDs
ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
Efficient transitive closure of sparse matrices over closed semirings
Theoretical Computer Science - Algebraic methods in language processing
On the transitive closure representation and adjustable compression
Proceedings of the 2006 ACM symposium on Applied computing
Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks
Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks
The Journal of Supercomputing
Dioïds and semirings: Links to fuzzy sets and other applications
Fuzzy Sets and Systems
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Web Appearance Disambiguation of Personal Names Based on Network Motif
WI '06 Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence
Decision-tree instance-space decomposition with grouped gain-ratio
Information Sciences: an International Journal
The Complexity of Tensor Circuit Evaluation
Computational Complexity
Towards a universal relation interface
VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
Logic Circuit for Cycle Detection in a State Diagram
IEEE Transactions on Computers
The Parallel Recognition of Classes of Graphs
IEEE Transactions on Computers
Bounds for Maxium Parallelism in a Bilogic Graph Model of Computations
IEEE Transactions on Computers
Admission of QoS aware users in a smart network
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Solving an urban waste collection problem using ants heuristics
Computers and Operations Research
A new method for generating compressed representation of transitive closure
Proceedings of the 2008 C3S2E conference
A new variant of the Pathfinder algorithm to generate large visual science maps in cubic time
Information Processing and Management: an International Journal
A multi-objective ant colony approach for pareto-optimization using dynamic programming
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Evolutionary synthesis of low-sensitivity equalizers using adjacency matrix representation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Automatic generation of path conditions for concurrent timed systems
Theoretical Computer Science
All-pairs shortest-paths for large graphs on the GPU
Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware
Narrative Structure of Mathematical Texts
Calculemus '07 / MKM '07 Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference
On the Deterministic Tracking of Moving Objects with a Binary Sensor Network
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Securing information flow via dynamic capture of dependencies
Journal of Computer Security - 20th IEEE Computer Security Foundations Symposium (CSF)
A methodology for the design and optimization of information processing systems
AFIPS '71 (Spring) Proceedings of the May 18-20, 1971, spring joint computer conference
Establishing lower bounds on algorithms: a survey
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Digital Filters Using Adjacency Matrix Representation
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Polyadic Dynamic Logics for HPSG Parsing
Journal of Logic, Language and Information
Component-based software version management based on a Component-Interface Dependency Matrix
Journal of Systems and Software
General spanning trees and reachability query evaluation
C3S2E '09 Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering
Detection of Locally Over-Represented GO Terms in Protein-Protein Interaction Networks
RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm
Journal of Artificial Intelligence Research
A Modified Matrix Algorithm for Determining the Complete Connection Matrix of a Switching Network
IEEE Transactions on Computers
A graph-based proactive fault identification approach in computer networks
Computer Communications
Finding all shortest distances in a directed network
IBM Journal of Research and Development
Virtual social networks online and mobile systems
Mobile Information Systems
Computer-aided diagnosis with an application to endocrinology
IBM Journal of Research and Development
On the selection of a platonic solid for mesh segmentation
INES'09 Proceedings of the IEEE 13th international conference on Intelligent Engineering Systems
Special network algorithms with gains
INES'09 Proceedings of the IEEE 13th international conference on Intelligent Engineering Systems
Enforcing Concurrent Temporal Behaviors
Electronic Notes in Theoretical Computer Science (ENTCS)
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
Fuzzy Sets and Systems
Teaching design & analysis of multi-core parallel algorithms using CUDA
Journal of Computing Sciences in Colleges
A new algorithm for finding faces in wireframes
Computer-Aided Design
Quantifying the discord: order discrepancies in message sequence charts
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Lock-free parallel dynamic programming
Journal of Parallel and Distributed Computing
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
ACM Transactions on Algorithms (TALG)
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
On automated program construction and verification
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Parallel FPGA-based all-pairs shortest-paths in a directed graph
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Performance of C++ bit-vector implementations
SAICSIT '10 Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists
Design and implementation of a public key-based group collaboration system
Computer Communications
An approach to identifying causes of implied scenarios using unenforceable orders
Information and Software Technology
FPGA based parallel transitive closure algorithm
Proceedings of the 2011 ACM Symposium on Applied Computing
Journal of Systems and Software
A memory efficient reachability data structure through bit vector compression
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Analysis of Deterministic Tracking of Multiple Objects Using a Binary Sensor Network
ACM Transactions on Sensor Networks (TOSN)
On Computing Deltas of RDF/S Knowledge Bases
ACM Transactions on the Web (TWEB)
A job-shop problem with one additional resource type
Journal of Scheduling
All-pairs shortest paths with a sublinear additive error
ACM Transactions on Algorithms (TALG)
A functional, successor list based version of warshall's algorithm with applications
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
A new alert correlation algorithm based on attack graph
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Finding top-k shortest path distance changes in an evolutionary network
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
OMG! orthologs in multiple genomes: competing graph-theoretical formulations
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Computing transitive closure problem on linear systolic array
NAA'04 Proceedings of the Third international conference on Numerical Analysis and its Applications
Path Planning Strategies for UAVS in 3D Environments
Journal of Intelligent and Robotic Systems
Finding min-sum disjoint shortest paths from a single source to all pairs of destinations
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A heterogeneous accelerator platform for multi-subject voxel-based brain network analysis
Proceedings of the International Conference on Computer-Aided Design
Fast and generalized polynomial time memory consistency verification
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Crossover can provably be useful in evolutionary computation
Theoretical Computer Science
Generating path conditions for timed systems
IFM'05 Proceedings of the 5th international conference on Integrated Formal Methods
A task parallel algorithm for finding all-pairs shortest paths using the GPU
International Journal of High Performance Computing and Networking
Standard cell routing via boolean satisfiability
Proceedings of the 49th Annual Design Automation Conference
Brief paper: Fault location using digraph and inverse direction search with application
Automatica (Journal of IFAC)
EQL: A language for numerical computation
Computer Languages
Planning temporal events using point-interval logic
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
An efficient parallel algorithm for the transitive closure of a graph
Journal of Systems and Software
Fast algorithms for the maximum convolution problem
Operations Research Letters
On negative cycles in mixed graphs
Operations Research Letters
Path planning with variable-fidelity terrain assessment
Robotics and Autonomous Systems
Distributed algorithms for network diameter and girth
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Detecting re-captured videos using shot-based photo response non-uniformity
IWDW'11 Proceedings of the 10th international conference on Digital-Forensics and Watermarking
On profiles and footprints --- relational semantics for petri nets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Semirings in Operations Research and Computer Science: More Algebra
Fundamenta Informaticae
Agent-based simulation for large-scale emergency response: A survey of usage and implementation
ACM Computing Surveys (CSUR)
Computing transitive closure of bipolar weighted digraphs
Discrete Applied Mathematics
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Simple rectangle-based functional programs for computing reflexive-transitive closures
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
RDFS reasoning on massively parallel hardware
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Network optimization prior to dynamic simulation of AMHS
Proceedings of the Winter Simulation Conference
Methodology to best extend AMHS for site expansion
Proceedings of the Winter Simulation Conference
Proceedings of the Winter Simulation Conference
Classifying unlabeled short texts using a fuzzy declarative approach
Language Resources and Evaluation
Least-restrictive enforcement of the Chinese wall security policy
Proceedings of the 18th ACM symposium on Access control models and technologies
Extreme points of the credal sets generated by elementary comparative probabilities
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
Information Sciences: an International Journal
FPGA implementation of particle swarm optimization for Bayesian network learning
Computers and Electrical Engineering
Mining stable patterns in multiple correlated databases
Decision Support Systems
Finite sets of data compatible with multidimensional inequality measures
Information Sciences: an International Journal
Efficient determination of the transitive closure of a directed graph
Information Processing Letters
| Hi-index | 0.19 |