Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Tiempo lineal")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV


A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 3356

  • Page / 135

Selection :

  • and

An approximation scheme for strip packing of rectangles with bounded dimensionsFERNANDEZ DE LA VEGA, W; ZISSIMOPOULOS, V.Discrete applied mathematics. 1998, Vol 82, Num 1-3, pp 93-101, issn 0166-218XArticle

FASTSP: linear time calculation of alignment accuracyMIRARAB, Siavash; WARNOW, Tandy.Bioinformatics (Oxford. Print). 2011, Vol 27, Num 23, pp 3250-3258, issn 1367-4803, 9 p.Article

Lempel, Even, and Cederbaum planarity methodBOYER, John M; FERNANDES, Cristina G; NOMA, Alexandre et al.Lecture notes in computer science. 2004, pp 129-144, issn 0302-9743, isbn 3-540-22067-4, 16 p.Conference Paper

Characterization of reachable/nonreachable cellular automata statesDAS, Sukanta; SIKDAR, Biplab K; PAL CHAUDHURI, P et al.Lecture notes in computer science. 2004, pp 813-822, issn 0302-9743, isbn 3-540-23596-5, 10 p.Conference Paper

On constrained minimum pseudotriangulationsROTE, Günter; CAO AN WANG; LUSHENG WANG et al.Lecture notes in computer science. 2003, pp 445-454, issn 0302-9743, isbn 3-540-40534-8, 10 p.Conference Paper

On minimum intersection of two minimum dominating sets of interval graphsCHANG, M.-S; HSU, C.-C.Discrete applied mathematics. 1997, Vol 78, Num 1-3, pp 41-50, issn 0166-218XArticle

Unique Horn renaming and Unique 2-SatisfiabilityHEBRARD, J.-J.Information processing letters. 1995, Vol 54, Num 4, pp 235-239, issn 0020-0190Article

A simpler linear-time recognition of circular-arc graphsKAPLAN, Haim; NUSSBAUM, Yahav.Lecture notes in computer science. 2006, pp 41-52, issn 0302-9743, isbn 3-540-35753-X, 1Vol, 12 p.Conference Paper

Drawing graphs with large vertices and thick edgesBAREQUET, Gill; GOODRICH, Michael T; RILEY, Chris et al.Lecture notes in computer science. 2003, pp 281-293, issn 0302-9743, isbn 3-540-40545-3, 13 p.Conference Paper

A linear time algorithm for finding a k-tree coreSHIOURA, A; UNO, T.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 281-290, issn 0196-6774Article

On piercing sets of axis-parallel rectangles and ringsSEGAL, M.Lecture notes in computer science. 1997, pp 430-442, issn 0302-9743, isbn 3-540-63397-9Conference Paper

Linear-time computation of local periodsDUVAL, Jean-Pierre; KOLPAKOV, Roman; KUCHEROV, Gregory et al.Lecture notes in computer science. 2003, pp 388-397, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals aloneMANACHER, Glenn K; MANKUS, Terrance A.Networks (New York, NY). 2002, Vol 39, Num 2, pp 68-72, issn 0028-3045Article

Area requirement of visibility representations of treesKANT, G; LIOTTA, G; TAMASSIA, R et al.Information processing letters. 1997, Vol 62, Num 2, pp 81-88, issn 0020-0190Article

Simple linear time recognition of unit interval graphsCORNEIL, D. G; HIRYOUNG KIM; SRIDHAR NATARAJAN et al.Information processing letters. 1995, Vol 55, Num 2, pp 99-104, issn 0020-0190Article

On tropical matrices of small factor rankSHITOV, Yaroslav.Linear algebra and its applications. 2012, Vol 437, Num 11, pp 2727-2732, issn 0024-3795, 6 p.Article

A linear time algorithm for constructing tree 4-spanner in 2-treesPANDA, B. S; DAS, Anita.Lecture notes in computer science. 2004, pp 21-30, issn 0302-9743, isbn 3-540-24126-4, 10 p.Conference Paper

Compact visibility representation and straight-line grid embedding of plane graphsHUAMING ZHANG; XIN HE.Lecture notes in computer science. 2003, pp 493-504, issn 0302-9743, isbn 3-540-40545-3, 12 p.Conference Paper

On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State SetVIELHABER, Michael; DEL PILAR CANALES CH, Monica.Lecture notes in computer science. 2006, pp 356-357, issn 0302-9743, isbn 3-540-31023-1, 1Vol, 2 p.Conference Paper

A linear-time algorithm for finding tree-decompositions of small treewidthBODLAENDER, H. L.SIAM journal on computing (Print). 1996, Vol 25, Num 6, pp 1305-1317, issn 0097-5397Article

Crochemore factorization of sturmian and other infinite wordsBERSTEL, Jean; SAVELLI, Alessandra.Lecture notes in computer science. 2006, pp 157-166, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 10 p.Conference Paper

Approximating edit distance efficientlyBAR-YOSSEF, Ziv; JAYRAM, T. S; KRAUTHGAMER, Robert et al.Annual Symposium on Foundations of Computer Science. 2004, pp 550-559, isbn 0-7695-2228-9, 1Vol, 10 p.Conference Paper

Fast algorithms for comparison of similar unordered treesFUKAGAWAL, Daiji; AKUTSU, Tatsuya.Lecture notes in computer science. 2004, pp 452-463, issn 0302-9743, isbn 3-540-24131-0, 12 p.Conference Paper

Uniform machine scheduling of unit-time jobs subject to resource constraintsKOVALYOV, M. Y; SHAFRANSKY, Y. M.Discrete applied mathematics. 1998, Vol 84, Num 1-3, pp 253-257, issn 0166-218XArticle

Single-layer channel routing and placement with single-sided netsGREENBERG, R. I; SHIH, J.-D.Computers & mathematics with applications (1987). 1996, Vol 32, Num 4, pp 1-7, issn 0898-1221Article

  • Page / 135