Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Complexité temps")

Filter

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

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 3595

  • Page / 144
Export

Selection :

  • and

Analysis of virtual-time complexity in weighted fair queuingALNUWEIRI, Hussein; TAYYAR, Haitham.Computer communications. 2005, Vol 28, Num 7, pp 802-810, issn 0140-3664, 9 p.Article

On the time complexity for circumscribing a convex polygonWOO, T. C; HYUAN-CHAN LEE.Computer vision, graphics, and image processing. 1985, Vol 30, Num 3, pp 362-363, issn 0734-189XArticle

Log-logarithmic worst-case range queries are possible in space Θ (N)WILLARD, D. E.Information processing letters. 1983, Vol 17, Num 2, pp 81-84, issn 0020-0190Article

A space efficient distributive sortHANDLEY, C. C.Information processing letters. 1991, Vol 37, Num 2, pp 75-78, issn 0020-0190, 4 p.Article

Finding the edge connectivity of directed graphsMANSOUR, Y; SCHIEBER, B.Journal of algorithms (Print). 1989, Vol 10, Num 1, pp 76-85, issn 0196-6774, 10 p.Article

Improved nonconservative sequential and parallel integer sortingHAGERUP, T; SHEN, H.Information processing letters. 1990, Vol 36, Num 2, pp 57-63, issn 0020-0190, 7 p.Article

Upward separation for FewP and related classesRAO, R. P. N; ROTHE, J; WATANABE, O et al.Information processing letters. 1994, Vol 52, Num 4, pp 175-180, issn 0020-0190Article

A speed-up theorem without tape compressionGEFFERT, V.Theoretical computer science. 1993, Vol 118, Num 1, pp 49-65, issn 0304-3975Conference Paper

Graph algorithms on a tree-structured parallel computerYEH, D. Y; LEE, D. T.BIT (Nordisk Tidskrift for Informationsbehandling). 1984, Vol 24, Num 3, pp 333-340, issn 0006-3835Article

Parallel breadth-first search algorithms for trees and graphsGHOSH, R. K; BHATTACHARJEE, G. P.International journal of computer mathematics. 1984, Vol 15, Num 3-4, pp 255-268, issn 0020-7160Article

Quasi-intermittency of waves and their complexity in modulated dielectric mediumNERUKH, A; RUZHYTSKA, N; NERUKH, D et al.Mathematical Methods in Electromagnetic Theory : MMET '06. 2006, pp 488-490, isbn 1-424-40490-8, 1Vol, 3 p.Conference Paper

O (n log n) filtering algorithms for unary resource constraintVILIM, Petr.Lecture notes in computer science. 2004, pp 335-347, issn 0302-9743, isbn 3-540-21836-X, 13 p.Conference Paper

Efficient optimal pagination of scrollsLARMORE, L. L; HIRSCHBERG, D. S.Communications of the ACM. 1985, Vol 28, Num 8, pp 854-856, issn 0001-0782Article

Complexity of sub-bus mesh computationsCONDON, A; LADNER, R; LAMPE, J et al.SIAM journal on computing (Print). 1996, Vol 25, Num 3, pp 520-539, issn 0097-5397Article

An O(nlogm) algorithm for VLSI design rule checkingBONAPACE, C. R; LO, C.-Y.IEEE transactions on computer-aided design of integrated circuits and systems. 1992, Vol 11, Num 6, pp 753-758, issn 0278-0070Article

Quicksort for equal keysWEGNER, L. M.IEEE transactions on computers. 1985, Vol 34, Num 4, pp 362-367, issn 0018-9340Article

On the complexity of calculating factorialsBORWEIN, P. B.Journal of algorithms (Print). 1985, Vol 6, Num 3, pp 376-380, issn 0196-6774Article

Preemptive scheduling to minimize maximum completion time on uniform processors with memory constraintsMARTEL, C.Operations research. 1985, Vol 33, Num 6, pp 1360-1380, issn 0030-364XArticle

A partitioning approach to the design of selection networksWAH, B. W; KUO-LIANG CHEN.IEEE transactions on computers. 1984, Vol 33, Num 3, pp 261-268, issn 0018-9340Article

A simple acceptance/rejection criterium for sequence generators in symmetric cryptographyFUSTER-SABATER, Amparo; CABALLERO-GIL, Pino.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25860-4, 4Vol, part III, 719-728Conference Paper

Message terminating algorithms for anonymous rings of unknown sizeCIDON, I; SHAVITT, Y.Information processing letters. 1995, Vol 54, Num 2, pp 111-119, issn 0020-0190Article

New attacks against reduced-round versions of IDEAJUNOD, Pascal.Lecture notes in computer science. 2005, pp 384-397, issn 0302-9743, isbn 3-540-26541-4, 14 p.Conference Paper

A model for uncertainty knowledgePEIMIN, D; SHICHAO, Z; WENLONG, N et al.High technology letters. 1997, Vol 3, Num 1, pp 46-48, issn 1006-6748Article

On the simulation of many storage heads by oneVITANYI, P. M. B.Theoretical computer science. 1984, Vol 34, Num 1-2, pp 157-168, issn 0304-3975Conference Paper

An inherently iterative computation of Ackermann's functionGROSSMAN, J. W; ZEITMAN, R. S.Theoretical computer science. 1988, Vol 57, Num 2-3, pp 327-330, issn 0304-3975Article

  • Page / 144