Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Complejidad algoritmo")

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

Language

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 5287

  • Page / 212
Export

Selection :

  • and

Optimal enclosing regions in planar graphsBIENSTOCK, D; MONMA, C. L.Networks (New York, NY). 1989, Vol 19, Num 1, pp 79-94, issn 0028-3045, 16 p.Article

New directions and new challenges in algorithm design and complexity, parameterizedFELLOWS, Michael R.Lecture notes in computer science. 2003, pp 505-519, issn 0302-9743, isbn 3-540-40545-3, 15 p.Conference Paper

Revisiting a result of KoCINTIOLI, P; SILVESTRI, R.Information processing letters. 1997, Vol 61, Num 4, pp 189-194, issn 0020-0190Article

Incremental condition estimationBISCHOF, C. H.SIAM journal on matrix analysis and applications. 1990, Vol 11, Num 2, pp 312-322, issn 0895-4798, 11 p.Article

Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fieldsFITCHAS, N; GALLIGO, A; MORGENSTERN, J et al.Journal of pure and applied algebra. 1990, Vol 67, Num 1, pp 1-14, issn 0022-4049, 14 p.Article

O(n2) algorithms for graph planarizationJAYAKUMAR, R; THULASIRAMAN, K; SWAMY, M. N. S et al.IEEE transactions on computer-aided design of integrated circuits and systems. 1989, Vol 8, Num 3, pp 257-267, issn 0278-0070, 11 p.Article

Parallel algorithms for cographs and parity graphs wirth applicationsADHAR, G. S; PENG, S.Journal of algorithms (Print). 1990, Vol 11, Num 2, pp 252-284, issn 0196-6774, 33 p.Article

Lower bounds for ShellsortPLAXTON, C. G; SUEL, T.Journal of algorithms (Print). 1997, Vol 23, Num 2, pp 221-240, issn 0196-6774Article

Arboricity and bipartite subgraph listing algorithmsEPPSTEIN, D.Information processing letters. 1994, Vol 51, Num 4, pp 207-211, issn 0020-0190Article

An O(n1.5) algforithm to color proper circular arcsWEI-KUAN SHIH; WEN-LIAN HSU.Discrete applied mathematics. 1989, Vol 25, Num 3, pp 321-323, issn 0166-218X, 3 p.Article

An algorithm for polynomial multiplication that does not depent on the ring constantsKAMINSKI, M.Journal of algorithms (Print). 1988, Vol 9, Num 1, pp 137-147, issn 0196-6774Article

SNPs problems, complexity, and algorithmsLANCIA, Giuseppe; BAFNA, Vineet; ISTRAIL, Sorin et al.Lecture notes in computer science. 2001, pp 182-193, issn 0302-9743, isbn 3-540-42493-8Conference Paper

On the correctness of linear closure in a class of estimation algorithmsKURKINA, M. V.Computational mathematics and mathematical physics. 1999, Vol 39, Num 4, pp 668-673, issn 0965-5425Article

A simple, efficient algorithm for maximum finding on ringsHIGHAM, L; PRZYTYCKA, T.Information processing letters. 1996, Vol 58, Num 6, pp 319-324, issn 0020-0190Article

A simple modification of Xunrang and Yuzhang's HEAPSORT variant improving its complexity significantlyWEGENER, I.Computer journal (Print). 1993, Vol 36, Num 3, pp 286-288, issn 0010-4620Article

A gray code for the ideals of a forest posetKODA, Y; RUSKEY, F.Journal of algorithms (Print). 1993, Vol 15, Num 2, pp 324-340, issn 0196-6774Article

An O (n2) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all horn sentencesARVIND, V; BISWAS, S.Information processing letters. 1987, Vol 24, Num 1, pp 67-69, issn 0020-0190Article

Computing a segment center for a planar point setAGARWAL, P. K; EFRAT, A; SHARIR, M et al.Journal of algorithms (Print). 1993, Vol 15, Num 2, pp 314-323, issn 0196-6774Article

On the distribution of comparisons in sorting algorithmsRICHARDS, D; PRAVIN VAIDYA.BIT (Nordisk Tidskrift for Informationsbehandling). 1988, Vol 28, Num 4, pp 764-774, issn 0006-3835Article

The complexity of generalized clique coveringCORNELL, D. G; FONLUPT, J.Discrete applied mathematics. 1988, Vol 22, Num 2, pp 109-118, issn 0166-218XArticle

Design Is as Easy as OptimizationCHAKRABARTY, Deeparnab; MEHTA, Aranyak; VAZIRANI, Vijay V et al.Lecture notes in computer science. 2006, pp 477-488, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequencesKAIDA, Takayasu.Lecture notes in computer science. 2005, pp 166-178, issn 0302-9743, isbn 3-540-26084-6, 13 p.Conference Paper

Computing the Betti numbers of arrangements in practiceBASU, Saugata; KETTNER, Michael.Lecture notes in computer science. 2005, pp 13-31, issn 0302-9743, isbn 3-540-28966-6, 19 p.Conference Paper

In-place sorting with fewer movesKATAJAINEN, J; PASANEN, T. A.Information processing letters. 1999, Vol 70, Num 1, pp 31-37, issn 0020-0190Article

Pseudorandom generators for space-bounded computationNISAN, N.Combinatorica (Print). 1992, Vol 12, Num 4, pp 449-461, issn 0209-9683Article

  • Page / 212