Search results for "transitive closure"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
4	Yugyung Lee, James Geller	Efficient Transitive Closure Reasoning in a Combined Class-Part-Containment Hierarchy.	Knowl. Inf. Syst.	2002	DBLP DOI BibTeX RDF	IS-A hierarchies, Materialized transitive closure, Parallel artificial intelligence, Parallel reasoning, Part hierarchies, Transitive closure reasoning
4	Biing-Feng Wang, Gen-Huey Chen	Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	related graph problems, reconfigurable bus systems, parallel algorithms, graph theory, minimum spanning trees, bipartite graphs, transitive closure, transitive closure, connected components, processor arrays, undirected graph, bridges, biconnected components, graph problems, articulation points
3	Anna Beletska, Denis Barthou, Wlodzimierz Bielecki, Albert Cohen	Computing the Transitive Closure of a Union of Affine Integer Tuple Relations.	COCOA	2009	DBLP DOI BibTeX RDF	affine tuple relations, transitive closure
3	Camil Demetrescu, Giuseppe F. Italiano	Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure.	Algorithmica	2008	DBLP DOI BibTeX RDF	Transitive closure, Dynamic graph algorithms
3	Ioannis Krommidas, Christos D. Zaroliagis	An experimental study of algorithms for fully dynamic transitive closure.	ACM Journal of Experimental Algorithmics	2008	DBLP DOI BibTeX RDF	reachability, Transitive closure, dynamic algorithm, path
3	Balder ten Cate, Luc Segoufin	XPath, transitive closure logic, and nested tree walking automata.	PODS	2008	DBLP DOI BibTeX RDF	tree walking automata, xpath, xml, transitive closure
3	Balder ten Cate	The expressivity of XPath with transitive closure.	PODS	2006	DBLP DOI BibTeX RDF	XML, XPath, semi-structured data, transitive closure
3	Camil Demetrescu, Giuseppe F. Italiano	Trade-offs for fully dynamic transitive closure on DAGs: breaking through the O(n2 barrier.	J. ACM	2005	DBLP DOI BibTeX RDF	transitive closure, Dynamic graph algorithms
3	Christian Delhommé, Teodor Knapik, D. Gnanaraj Thomas	Using Transitive-Closure Logic for Deciding Linear Properties of Monoids.	MFCS	2003	DBLP DOI BibTeX RDF	monoid presentations, transitive closure logic, string rewriting
3	Vivek Gaur, Vishwani D. Agrawal, Michael L. Bushnell	A New Transitive Closure Algorithm with Application to Redundancy Identification.	DELTA	2002	DBLP DOI BibTeX RDF	logic redundancy, partial implications, transitive closure, Implication graph
3	Ismail H. Toroslu, Ghassan Z. Qadah, Lawrence J. Henschen	An efficient database transitive closure algorithm.	Appl. Intell.	1994	DBLP DOI BibTeX RDF	recursive rules, recursive query processing, transitive closure queries, Knowledge bases, deductive databases
3	Yannis E. Ioannidis, Raghu Ramakrishnan, Linda Winger	Transitive Closure Algorithms Based on Graph Traversal.	ACM Trans. Database Syst.	1993	DBLP DOI BibTeX RDF	node reachability, transitive closure, depth-first search, path computations
3	Chris J. Scheiman, Peter R. Cappello	A Processor-Time-Minimal Systolic Array for Transitive Closure.	IEEE Trans. Parallel Distrib. Syst.	1992	DBLP DOI BibTeX RDF	processor-time-minimal multiprocessor schedules, 2-D mesh, parallel algorithms, systolic array, systolic arrays, directed acyclic graph, multiprocessor schedule, transitive closure
3	Ghassan Z. Qadah, Lawrence J. Henschen, Jung J. Kim	Efficient Algorithms for the Instantiated Transitive Closure Queries.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	instantiated transitive closure queries, delta -wavefront, super-TC, disk page, processed TC query, performance evaluation, performance evaluation, query languages, database theory, database theory, generic algorithm, wavefront, recursive queries
3	Rakesh Agrawal, Shaul Dar, H. V. Jagadish	Direct Transitive Closure Algorithms: Design and Performance Evaluation.	ACM Trans. Database Syst.	1990	DBLP DOI BibTeX RDF	query processing, deductive databases, transitive closure
3	Anestis A. Toptsis, Clement T. Yu, Peter C. Nelson	Computing the Transitive Closure of Symmetric Matrices.	ICCI	1990	DBLP DOI BibTeX RDF	Transitive closure, binary relation, symmetric matrix
3	Franco P. Preparata, Roberto Tamassia	Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract)	FOCS	1988	DBLP DOI BibTeX RDF	insertion/deletion, fully dynamic techniques, planar structures, planar st-graph, transitive-closure queries, monotone subdivisions, chain method, Lee-Preparata, data structure, update, edges, transitive closure, faces, set, vertices, total orders, point location
2	Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yang Xiang	Computing label-constraint reachability in graph databases.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	generalized transitive closure, hoeffding and bernstein bounds, label-constraint reachability, maximal directed spanning tree
2	Arnab Bhattacharyya, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff	Transitive-closure spanners.	SODA	2009	DBLP DOI BibTeX RDF
2	Chan Le Duc	Decidability of SHI with Transitive Closure of Roles.	ESWC	2009	DBLP DOI BibTeX RDF	OWL, Description Logics, Decidability, Tableaux
2	Jakub Michaliszyn	Decidability of the Guarded Fragment with the Transitive Closure.	ICALP	2009	DBLP DOI BibTeX RDF
2	Sudhir Vinjamuri, Viktor K. Prasanna	Transitive closure on the cell broadband engine: A study on self-scheduling in a multicore processor.	IPDPS	2009	DBLP DOI BibTeX RDF
2	Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry	3-HOP: a high-compression indexing scheme for reachability query.	SIGMOD Conference	2009	DBLP DOI BibTeX RDF	2-hop, 3-hop, path-tree, transitive closure, graph indexing, reachability queries
2	Liam Roditty	A faster and simpler fully dynamic transitive closure.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	directed graph, reachability, Dynamic graph algorithms
2	Lihong Zhang, C.-J. Richard Shi, Yingtao Jiang	Symmetry-aware placement with transitive closure graphs for analog layout design.	ASP-DAC	2008	DBLP DOI BibTeX RDF
2	Yangjun Chen	A new method for generating compressed representation of transitive closure.	C3S2E	2008	DBLP DOI BibTeX RDF
2	Jacinto González-Pachón, Carlos Romero	A method for obtaining transitive approximations of a binary relation.	Annals OR	2008	DBLP DOI BibTeX RDF	Transitive approximation, Maximal transitive sub-relation, Transitive opening, Transitive closure, Goal programming, Binary relation
2	Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang	Temporal floorplanning using the three-dimensional transitive closure subGraph.	ACM Trans. Design Autom. Electr. Syst.	2007	DBLP DOI BibTeX RDF	temporal floorplanning, Reconfigurable computing, partially dynamical reconfiguration
2	Jinjun Xiong, Lei He	Probabilistic Transitive-Closure Ordering and Its Application on Variational Buffer Insertion.	IEEE Trans. on CAD of Integrated Circuits and Systems	2007	DBLP DOI BibTeX RDF
2	Krzysztof Diks, Piotr Sankowski	Dynamic Plane Transitive Closure.	ESA	2007	DBLP DOI BibTeX RDF
2	Anna Nepomniaschaya	Associative Version of Italiano's Decremental Algorithm for the Transitive Closure Problem.	PaCT	2007	DBLP DOI BibTeX RDF
2	Xun Yi	Directed Transitive Signature Scheme.	CT-RSA	2007	DBLP DOI BibTeX RDF	Directed transitive signature, transitive closure and reduction, RSA inversion problem over a cyclic group
2	Joost Engelfriet, Hendrik Jan Hoogeboom	Nested Pebbles and Transitive Closure.	STACS	2006	DBLP DOI BibTeX RDF
2	Yangjun Chen, Donovan Cooke	On the transitive closure representation and adjustable compression.	SAC	2006	DBLP DOI BibTeX RDF	databases, directed acyclic graphs, transitive closures, branchings, graph decomposition, topological order
2	Michael Cohen	Articulated Modeling of Distributed Privacy: Transitive Closure of Composition of Narrowcasting and Multipresence.	CIT	2006	DBLP DOI BibTeX RDF
2	Jinjun Xiong, Lei He	Fast buffer insertion considering process variations.	ISPD	2006	DBLP DOI BibTeX RDF	pruning rule, dynamic programming, process variation, transitive closure, buffer insertion
2	Jean Frédéric Myoupo, David Semé	Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory.	The Journal of Supercomputing	2006	DBLP DOI BibTeX RDF	Parallel algorithm, Graph theory, Broadcast, Selection, Reduction, Spanning tree, Bipartite graph, Transitive closure, Connected components, Bridge, CRCW PRAM, Articulation point
2	Chaoyi Pang, Guozhu Dong, Kotagiri Ramamohanarao	Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL.	ACM Trans. Database Syst.	2005	DBLP DOI BibTeX RDF	SQL, maintenance, first-order logic, incremental algorithm, Database view
2	Jai-Ming Lin, Yao-Wen Chang	TCG: A transitive closure graph-based representation for general floorplans.	IEEE Trans. VLSI Syst.	2005	DBLP DOI BibTeX RDF
2	Ioannis Krommidas, Christos D. Zaroliagis	An Experimental Study of Algorithms for Fully Dynamic Transitive Closure.	ESA	2005	DBLP DOI BibTeX RDF
2	Luis Garmendia, Adela Salvador	A New Algorithm to Compute Low T-Transitive Approximation of a Fuzzy Relation Preserving Symmetry. Comparisons with the T-Transitive Closure.	ECSQARU	2005	DBLP DOI BibTeX RDF
2	Luis Garmendia, Adela Salvador	Comparing Transitive Closure with a New T-transitivization Method.	MDAI	2004	DBLP DOI BibTeX RDF
2	Igor Z. Milovanovic, Emina I. Milovanovic, B. M. Randjelovic	Computing Transitive Closure Problem on Linear Systolic Array.	NAA	2004	DBLP DOI BibTeX RDF
2	Edson Norberto Cáceres, Cristiano Costa Argemom Vieira	Revisiting a BSP/CGM Transitive Closure Algorithm.	SBAC-PAD	2004	DBLP DOI BibTeX RDF
2	Piotr Sankowski	Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract).	FOCS	2004	DBLP DOI BibTeX RDF
2	Neil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh	The Boundary Between Decidability and Undecidability for Transitive-Closure Logics.	CSL	2004	DBLP DOI BibTeX RDF
2	Liam Roditty	A faster and simpler fully dynamic transitive closure.	SODA	2003	DBLP DOI BibTeX RDF
2	Thomas Baar	The Definition of Transitive Closure with OCL - Limitations and Applications.	Ershov Memorial Conference	2003	DBLP DOI BibTeX RDF
2	Vishal J. Mehta, Kunal K. Dave, Vishwani D. Agrawal, Michael L. Bushnell	A Fault-Independent Transitive Closure Algorithm for Redundancy Identification.	VLSI Design	2003	DBLP DOI BibTeX RDF
2	Floris Geerts, Bart Kuijpers	Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases.	ICDT	2003	DBLP DOI BibTeX RDF
2	Carlos E. R. Alves, Edson Cáceres, A. A. Castro Jr., Siang W. Song, Jayme Luiz Szwarcfiter	Efficient Parallel Implementation of Transitive Closure of Digraphs.	PVM/MPI	2003	DBLP DOI BibTeX RDF
2	Bernard De Baets, Hans De Meyer	Transitive approximation of fuzzy relations by alternating closures and openings.	Soft Comput.	2003	DBLP DOI BibTeX RDF	Min-transitive approximation, Transitive opening, Transitivity, Transitive closure, Fuzzy relation, Copula, Triangular norm
2	Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang	Arbitrarily shaped rectilinear module placement using the transitive closure graph representation.	IEEE Trans. VLSI Syst.	2002	DBLP DOI BibTeX RDF
2	Kai-Pui Lam, Sui-Tung Mak	On Computing Transitive-Closure Equivalence Sets Using a Hybrid GA-DP Approach.	FPL	2002	DBLP DOI BibTeX RDF
2	Seema Bawa, G. K. Sharma	A Parallel Transitive Closure Computation Algorithm for VLSI Test Generation.	PARA	2002	DBLP BibTeX RDF
2	Surender Baswana, Ramesh Hariharan, Sandeep Sen	Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths.	STOC	2002	DBLP DOI BibTeX RDF	BFS tree, decremental, reachability
2	Silvio Micali, Ronald L. Rivest	Transitive Signature Schemes.	CT-RSA	2002	DBLP DOI BibTeX RDF	graphs, digital signatures, public-key cryptography, transitive closure
2	Franz Baader, Ralf Küsters	Unification in a Description Logic with Transitive Closure of Roles.	LPAR	2001	DBLP DOI BibTeX RDF
2	William Hesse	The Dynamic Complexity of Transitive Closure Is In DynTC0.	ICDT	2001	DBLP DOI BibTeX RDF
2	Floris Geerts	Linear Approximation of Semi-algebraic Spatial Databases Using Transitive Closure Logic, in Arbitrary Dimension.	DBPL	2001	DBLP DOI BibTeX RDF
2	Valerie King, Mikkel Thorup	A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms.	COCOON	2001	DBLP DOI BibTeX RDF
2	Aris Pagourtzis, Igor Potapov, Wojciech Rytter	PVM Computation of the Transitive Closure: The Dependency Graph Approach.	PVM/MPI	2001	DBLP DOI BibTeX RDF
2	Kjell Lemström, Lauri Hella	Approximate Pattern Matching is Expressible in Transitive Closure Logic.	LICS	2000	DBLP DOI BibTeX RDF
2	Camil Demetrescu, Giuseppe F. Italiano	Fully Dynamic Transitive Closure: Breaking Through the O(n2) Barrier.	FOCS	2000	DBLP DOI BibTeX RDF	fully dynamic transitive closure, unit worst-case cost, amortized time, single-operation complexity, subquadratic algorithm, computational complexity, randomized algorithm, queries, directed graphs, directed graphs, polynomials, polynomials, directed acyclic graphs, matrix multiplication, matrix multiplication, deterministic algorithms, deterministic algorithm, randomised algorithms
2	Floris Geerts, Bart Kuijpers	Linear Approximation of Planar Spatial Databases Using Transitive-Closure Logic.	PODS	2000	DBLP DOI BibTeX RDF
2	Odile Piton, Denis Maurel	``Beijing Frowns and Washington Pays Close Attention'' Computer Processing of Relations between Geographical Proper Names in Foreign Affairs.	NLDB	2000	DBLP DOI BibTeX RDF	Proper Names, Place Name, Inhabitant Name, Geographical Proper Names, Computing Method, Natural Language Processing (NLP), Transitive closure, Electronic Dictionary, Relational Data Base
2	Massimo Franceschet, Angelo Montanari	Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events.	AI*IA	1999	DBLP DOI BibTeX RDF
2	Matthias Ruhl	Counting and Addition Cannot Express Deterministic Transitive Closure.	LICS	1999	DBLP DOI BibTeX RDF	Counting quantifiers, circuit complexity, finite model theory, descriptive complexity theory
2	Valerie King	Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs.	FOCS	1999	DBLP DOI BibTeX RDF
2	Sanjay V. Rajopadhye, Claude Tadonki, Tanguy Risset	The Algebraic Path Problem Revisited.	Euro-Par	1999	DBLP DOI BibTeX RDF	Warshall-Floyd & Gauss-Jordan elimination, systolic synthesis, recurrence equations, scheduling, shortest path, transitive closure, matrix inversion, space-time mapping
2	Leonid Libkin, Limsoon Wong	Unary Quantifiers, Transitive Closure, and Relations of Large Degree.	STACS	1998	DBLP DOI BibTeX RDF
2	Neil Immerman, Moshe Y. Vardi	Model Checking and Transitive-Closure Logic.	CAV	1997	DBLP DOI BibTeX RDF
2	Horng-Ren Tsai, Shi-Jinn Horng, Shun-Shan Tsai, Tzong-Wann Kao, Shung-Shing Lee	Solving an Algebraic Path Problem and Some Related Graph Problems on a Hyper-Bus Broadcast Network.	IEEE Trans. Parallel Distrib. Syst.	1997	DBLP DOI BibTeX RDF	Hyper-bus broadcast network, matrix multiplication operation, minimum-weight spanning tree, parallel algorithm, graph theory, connectivity, transitive closure, connected component, bridge, biconnected component, all-pair shortest paths, articulation point, algebraic path problem
2	Keqin Li	Constant Time Boolean Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System.	The Journal of Supercomputing	1997	DBLP DOI BibTeX RDF	Boolean matrix closure, reconfigurability, time complexity, cost, transitive closure, processor array, optical bus, boolean matrix multiplication
2	Vishwani D. Agrawal, Michael L. Bushnell, Qing Lin	Redundancy Identification Using Transitive Closure.	Asian Test Symposium	1996	DBLP DOI BibTeX RDF
2	Jean Frédéric Myoupo, Anne-Cécile Fabret	A Modular Systolic Linearization of the Warshall-Floyd Algorithm.	IEEE Trans. Parallel Distrib. Syst.	1996	DBLP DOI BibTeX RDF	Modular linear systolic algorithms, shortest path, matrix multiplication, transitive closure
2	Jong-Chuang Tsay, Pen-Yuang Chang	Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure.	IEEE Trans. Parallel Distrib. Syst.	1995	DBLP DOI BibTeX RDF
2	Thore Husfeldt	Fully Dynamic Transitive Closure in Plane Dags with One Source and One Sink.	ESA	1995	DBLP DOI BibTeX RDF
2	Monika Rauch Henzinger, Valerie King	Fully Dynamic Biconnectivity and Transitive Closure.	FOCS	1995	DBLP DOI BibTeX RDF	fully dynamic biconnectivity, n-node graph, edge insertion, polylogarithmic time, Las-Vegas style, computational complexity, graph theory, randomized algorithm, transitive closure, deletion, randomised algorithms, dynamic algorithm, algorithm theory
2	Shaul Dar, Raghu Ramakrishnan	A Performance Study of Transitive Closure Algorithms.	SIGMOD Conference	1994	DBLP DOI BibTeX RDF
2	Edith Cohen	Estimating the Size of the Transitive Closure in Linear Time	FOCS	1994	DBLP DOI BibTeX RDF	size-estimation algorithms, reachability information, query optimization, randomized algorithm, directed graphs, transitive closure, database applications, neighborhoods, linear time, fast matrix multiplication
2	Dan Suciu, Jan Paredaens	Any Algorithm in the Complex Object Algebra with Powerset Needs Exponential Space to Compute Transitive Closure.	PODS	1994	DBLP DOI BibTeX RDF
2	Srimat T. Chakradhar, Vishwani D. Agrawal, Steven G. Rothweiler	A transitive closure algorithm for test generation.	IEEE Trans. on CAD of Integrated Circuits and Systems	1993	DBLP DOI BibTeX RDF
2	Klaus Simon, Davide Crippa, Fabian Collenberg	On the Distribution of the Transitive Closure in a Random Acyclic Digraph.	ESA	1993	DBLP DOI BibTeX RDF
2	Keh-Chang Guh, Clement T. Yu	Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments.	IEEE Trans. Knowl. Data Eng.	1992	DBLP DOI BibTeX RDF	centralised environments, materialized generalized transitive closure, computational complexity, parallel processing, data structure, data structures, expert systems, queries, time complexities, deductive databases, insertions, deletions, parallel environments, multiprocessor environment
2	Dilip Sarkar, Amar Mukherjee	Design of Optimal Systolic Algorithms for the Transitive Closure Problem.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	transitive closure problem, optimal systolic algorithms, Warshal-Floyd algorithm, pipelined parallel algorithms, RCT diagram, parallel algorithms, data dependency, systolic algorithms
2	Erich Grädel, Gregory L. McColm	Hierarchies in Transitive Closure Logic, Stratified Datalog and Infinitary Logic	FOCS	1992	DBLP DOI BibTeX RDF	universal quantifiers, transitive closure logic, stratified Datalog, general hierarchy theorem, quantifier classes, infinitary logic
2	Gen-Huey Chen, Biing-Feng Wang, Chi-Jen Lu	On the Parallel Computation of the Algebraic Path Problem.	IEEE Trans. Parallel Distrib. Syst.	1992	DBLP DOI BibTeX RDF	all pairsshortest paths, reconfigurable bus system, repeated matrix multiplications, parallel algorithms, computational complexity, parallel computation, graph theory, minimum spanning tree, transitive closure, processor array, CRCW PRAM, graph problems, algebraic path problem
2	Anestis A. Toptsis	Parallel Transitive Closure Computation in Highly Scalable Multiprocessors.	ICCI	1991	DBLP DOI BibTeX RDF
2	Erich Grädel	On Transitive Closure Logic.	CSL	1991	DBLP DOI BibTeX RDF
2	Jiawei Han, Ling Liu	Efficient Evaluation of Multiple Linear Recursions.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	multiple one sided linear recursions, multiple balanced K-sided recursions, multiple mixed K-sided recursion, side-coherent multiple linear recursions, single-linear recursive query evaluation, side-relation unioned processing, side-relation unioned transitive closure algorithm, side-relation unioned magic sets method, single-probe queries, information retrieval, database theory, deductive database, deductive databases, recursive functions
2	Johann Eder	Extending SQL with General Transitive Closure and Extreme Value Selections.	IEEE Trans. Knowl. Data Eng.	1990	DBLP DOI BibTeX RDF	general transitive closure, recursive query processing applications, general recursive capabilities, existing query languages, database language SQL, view definition mechanism, extreme value sections, special constructs, maximal values, recursively defined views, nonlinear recursion, standards, database management systems, query languages, attributes, information retrieval systems, tuples, recursive structures
2	H. V. Jagadish	A Compression Technique to Materialize Transitive Closure.	ACM Trans. Database Syst.	1990	DBLP DOI BibTeX RDF
2	Jeffrey D. Ullman, Mihalis Yannakakis	The Input/Output Complexity of Transitive Closure.	SIGMOD Conference	1990	DBLP DOI BibTeX RDF
2	Filippo Cacace, Stefano Ceri, Maurice A. W. Houtsma	An Overview of Parallel Strategies for Transitive Closure on Algebraic Machines.	PRISMA Workshop	1990	DBLP DOI BibTeX RDF
2	Maurice A. W. Houtsma, Peter M. G. Apers, Stefano Ceri	Complex Transitive Closure Queries on a Fragmented Graph.	ICDT	1990	DBLP DOI BibTeX RDF
2	Oscar H. Ibarra, Stephen M. Sohn	On Mapping Systolic Algorithms onto the Hypercube.	IEEE Trans. Parallel Distrib. Syst.	1990	DBLP DOI BibTeX RDF	parallel to parallel mappings, time-space graph, one way linear systolic array, systolic array algorithms, fixed-size hypercube architecture, two-dimensional systolic arrays, 64-node NCUBE/7 MIMD hypercube machine, shuffle scheduling problem, finite impulse response filtering, linear context-free language recognition, Boolean transitive closure, performance evaluation, parallel algorithms, computational complexity, parallel computers, parallel architectures, hypercube, matrix multiplication, interprocessor communication, cellular arrays, systolic algorithms, local computation
2	Joachim Biskup, Holger Stiefeling	Transitive Closure Algorithms for Very Large Databases.	WG	1988	DBLP DOI BibTeX RDF
2	Jiawei Han, Ghassan Z. Qadah, Chinying Chaou	The Processing and Evaluation of Transitive Closure Queries.	EDBT	1988	DBLP DOI BibTeX RDF
2	Seppo Sippu, Eljas Soisalon-Soininen	A Generalized Transitive Closure for Relational Queries.	PODS	1988	DBLP DOI BibTeX RDF