Abstract derivation of transitive closure algorithmsFEIJS, L. M. G; VAN OMMERING, R. C.Information processing letters. 1997, Vol 63, Num 3, pp 159-164, issn 0020-0190Article

Reasoning about iteration in Gödel's class theoryGIJSBERTUS, Johan; BELINFANTE, Frederik.Lecture notes in computer science. 2003, pp 228-242, issn 0302-9743, isbn 3-540-40559-3, 15 p.Conference Paper

Extending fuzzy relationsGONZALEZ, L; MARIN, A.Fuzzy sets and systems. 1995, Vol 69, Num 2, pp 157-169, issn 0165-0114Article

Combinatorial properties of dependence graphsEHRENFEUCHT, A; HOOGEBOOM, H. J; ROZENBERG, G et al.Information and computation (Print). 1994, Vol 114, Num 2, pp 315-328, issn 0890-5401Article

T-eigen fuzzy setsFERNANDEZ, M. J; SUAREZ, F; GIL, P et al.Information sciences. 1993, Vol 75, Num 1-2, pp 63-80, issn 0020-0255Article

Computing a transitive opening of a reflexive and symmetric fuzzy relationGARMENDIA, Luis; SALVADOR, Adela.Lecture notes in computer science. 2005, pp 587-599, issn 0302-9743, isbn 3-540-27326-3, 13 p.Conference Paper

Normalizable Horn clauses, strongly recognizable relations, and SpiNIELSON, Flemming; NIELSON, Hanne Riis; SEIDL, Helmut et al.Lecture notes in computer science. 2002, pp 20-35, issn 0302-9743, isbn 3-540-44235-9, 16 p.Conference Paper

Regular model checking made simple and efficientPAROSH AZIZ ABDULLA; JONSSON, Bengt; NILSSON, Marcus et al.Lecture notes in computer science. 2002, pp 116-130, issn 0302-9743, isbn 3-540-44043-7, 15 p.Conference Paper

Transitive signature schemesMICALI, Silvio; RIVEST, Ronald L.Lecture notes in computer science. 2002, pp 236-243, issn 0302-9743, isbn 3-540-43224-8Conference Paper

Confluence of untyped lambda calculus via simple typesGHILEZAN, Silvia; KUNCAK, Viktor.Lecture notes in computer science. 2001, pp 38-49, issn 0302-9743, isbn 3-540-42672-8Conference Paper

Minimizing redundant dependencies and interprocessor synchronizationsHENG-YI CHAO; HARPER, M. P.International journal of parallel programming. 1995, Vol 23, Num 3, pp 245-262, issn 0885-7458Article

Extending SQL with generalized transitive closureSHAUL DAR; RAKESH AGRAWAL.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 5, pp 799-812, issn 1041-4347Article

Answering cooperative recursive queries in web Federated databasesBALABAN, Mira; BEREZANSKY, Nikolai; GUDES, Ehud et al.Lecture notes in computer science. 2002, pp 14-28, issn 0302-9743, isbn 3-540-43819-X, 15 p.Conference Paper

Directed hypergraphs : Problems, algorithmic results, and a novel decremental approachAUSIELLO, Giorgio; FRANCIOSA, Paolo G; FRIGIONI, Daniele et al.Lecture notes in computer science. 2001, pp 312-327, issn 0302-9743, isbn 3-540-42672-8Conference Paper

Pvm computation of the transitive closure : The dependency graph approachPAGOURTZIS, Aris; POTAPOV, Igor; RYTTER, Wojciech et al.Lecture notes in computer science. 2001, pp 249-256, issn 0302-9743, isbn 3-540-42609-4Conference Paper

Clôture transitive et reconstruction = Transitive closure and reconstructionBOUDABBOUS, Youssef; CHERIF, Bahri.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 2000, Vol 331, Num 1, pp 5-10, issn 0764-4442Article

Analyse de Dépendances de Jacobiennes Creuses pour la Différentiation Automatique = Dependance Analysis for Sparse Jacobian Computation in Automatic DifferentiationTadjouddine, Mohamed; Tadj Ouddine, Mohamed; Galligo, Andre et al.1999, 191 p.Thesis

NC algorithms for dynamically solving the all pairs shortest paths problem and related problemsLIANG, W; MCKAY, B. D; SHEN, H et al.Information processing letters. 1996, Vol 58, Num 3, pp 149-155, issn 0020-0190Article

Teh serial transitive closure problem for treesBONET, M. L; BUSS, S. R.SIAM journal on computing (Print). 1995, Vol 24, Num 1, pp 109-122, issn 0097-5397Article

Query size estimation by adaptive samplingLIPTON, R. J; NAUGHTON, J. F.Journal of computer and system sciences (Print). 1995, Vol 51, Num 1, pp 18-25, issn 0022-0000Conference Paper

On the parallel computation of the algebraic path problemGEN-HUEY CHEN; BIING-FENG WANG; CHI-JEN LU et al.IEEE transactions on parallel and distributed systems. 1992, Vol 3, Num 2, pp 251-256Article

An experimental study of algorithms for fully dynamic transitive closureKROMMIDAS, Ioannis; ZAROLIAGIS, Christos.Lecture notes in computer science. 2005, pp 544-555, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

Comparing transitive closure with a new T-transitivization methodGARMENDIA, Luis; SALVADOR, Adela.Lecture notes in computer science. 2004, pp 306-315, issn 0302-9743, isbn 3-540-22555-2, 10 p.Conference Paper

Observations on parallel computation of transitive and max-closure problemsPAGOURTZIS, Aris; POTAPOV, Igor; RYTTER, Wojciech et al.Lecture notes in computer science. 2002, pp 217-225, issn 0302-9743, isbn 3-540-44296-0, 9 p.Conference Paper

Forewarned is fore-armed: Dynamic digraph connectivity with lookahead speeds up a static clustering algorithmRAMNATH, Sarnath.Lecture notes in computer science. 2002, pp 220-229, issn 0302-9743, isbn 3-540-43866-1, 10 p.Conference Paper