On the number of descendants in an object DAGSHIDLOVSKY, B; BERTINO, E.Information processing letters. 1996, Vol 58, Num 5, pp 211-216, issn 0020-0190Article

A tile-based coordination view of asynchronous π-calculusFERRARI, G; MONTANARI, U.Lecture notes in computer science. 1997, pp 52-70, issn 0302-9743, isbn 3-540-63437-1Conference Paper

SHAPE : a machine learning system from examplesBOTANA, F; BAHAMONDE, A.International journal of human-computer studies. 1995, Vol 42, Num 2, pp 137-155, issn 1071-5819Article

Approximations for the maximum acyclic subgraph problemHASSIN, R; RUBINSTEIN, S.Information processing letters. 1994, Vol 51, Num 3, pp 133-140, issn 0020-0190Article

Hierarchical Constraint Satisfaction based on subdefinite modelsUSHAKOV, Dmitry.Lecture notes in computer science. 2001, pp 434-445, issn 0302-9743, isbn 3-540-43075-XConference Paper

A new approximation algorithm for the register allocation problemJANSEN, K; REITER, J.Lecture notes in computer science. 1997, pp 135-146, issn 0302-9743, isbn 3-540-63138-0Conference Paper

Direct construction of Compact Directed Acyclic Word graphsCROCHEMORE, M; VERIN, R.Lecture notes in computer science. 1997, pp 116-129, issn 0302-9743, isbn 3-540-63220-4Conference Paper

Multi-processor scheduling and expandersKUZJURIN, N. N.Information processing letters. 1994, Vol 51, Num 6, pp 315-319, issn 0020-0190Article

Speeding up dynamic transitive closure for bounded degree graphsYELLIN, D. M.Acta informatica. 1993, Vol 30, Num 4, pp 369-384, issn 0001-5903Article

Acyclic molecules with second maximal energyJIANPING OU.Applied mathematics letters. 2010, Vol 23, Num 4, pp 343-346, issn 0893-9659, 4 p.Article

CursorsLE MAOUT, Vincent.Lecture notes in computer science. 2001, pp 195-207, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Generating the acyclic orientations of a graphSQUIRE, M. B.Journal of algorithms (Print). 1998, Vol 26, Num 2, pp 275-290, issn 0196-6774Article

Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delaysJUNG, H; KIROUSIS, L. M; SPIRAKIS, P et al.Information and computation (Print). 1993, Vol 105, Num 1, pp 94-104, issn 0890-5401Article

Computing rooted communication reliability in an almost acyclic digraphHAGSTROM, J. N.Networks (New York, NY). 1991, Vol 21, Num 5, pp 581-593, issn 0028-3045Article

Some methods of investigating regeneration times in queueing networksTSITSIASHVILI, G. SH.Theory of probability and its applications. 1990, Vol 35, Num 2, pp 387-390, issn 0040-585XArticle

Parameterized complexity of directed feedback set problems in tournamentsRAMAN, Venkatesh; SAURABH, Saket.Lecture notes in computer science. 2003, pp 484-492, issn 0302-9743, isbn 3-540-40545-3, 9 p.Conference Paper

Direct construction of minimal acyclic subsequential transducersMIHOV, Stoyan; MAUREL, Denis.Lecture notes in computer science. 2001, pp 217-229, issn 0302-9743, isbn 3-540-42491-1Conference Paper

Enabling Sparse Constant propagation of array elements via Array SSA formSARKAR, V; KNOBE, K.Lecture notes in computer science. 1998, pp 33-56, issn 0302-9743, isbn 3-540-65014-8Conference Paper

Subtyping over a latticeTIURYN, J.Lecture notes in computer science. 1997, pp 84-88, issn 0302-9743, isbn 3-540-63385-5Conference Paper

Frequency of even and odd numbers in distance matrices of treesLUKOVITS, I.Journal of chemical information and computer sciences. 1993, Vol 33, Num 4, pp 626-629, issn 0095-2338Article

Some remarks on Adám's conjecture for simple directed graphsJIRASEK, J.Discrete mathematics. 1992, Vol 108, Num 1-3, pp 327-332, issn 0012-365XArticle

Patterns on numerical semigroupsBRAS-AMOROS, Maria; GARCIA-SANCHEZ, Pedro A.Linear algebra and its applications. 2006, Vol 414, Num 2-3, pp 652-669, issn 0024-3795, 18 p.Article

Episode matchingTRONICEK, Zdenek.Lecture notes in computer science. 2001, pp 143-146, issn 0302-9743, isbn 3-540-42271-4Conference Paper

Strongly simply connected tilted algebrasASSEM, I; LIU, S.Annales des sciences mathématiques du Québec. 1997, Vol 21, Num 1, pp 13-22, issn 0707-9109Article

Disjoint paths in acyclic digraphsMETZLAR, A.Journal of combinatorial theory. Series B. 1993, Vol 57, Num 2, pp 228-238, issn 0095-8956Article