Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Time complexity")

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 3474

  • Page / 139
Export

Selection :

  • and

An Efficient Characterization of a Family of Hyperbent FunctionsLISONEK, Petr.IEEE transactions on information theory. 2011, Vol 57, Num 9, pp 6010-6014, issn 0018-9448, 5 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

A space efficient distributive sortHANDLEY, C. C.Information processing letters. 1991, Vol 37, Num 2, pp 75-78, issn 0020-0190, 4 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

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

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

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 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

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

A more efficient notion of zigzag stabilityLE SAËC, B; LITOVSKY, I; PATROU, B et al.Informatique théorique et applications (Imprimé). 1996, Vol 30, Num 3, pp 181-194, issn 0988-3754Article

Dynamic negative selection algorithm based on match range modelJUNGAN CHEN; FENG LIANG; DONGYONG YANG et al.Lecture notes in computer science. 2005, pp 847-851, issn 0302-9743, isbn 3-540-30462-2, 1Vol, 5 p.Conference Paper

New minimal modified Radix-r representation with applications to smart cardsJOYE, Marc; YEN, Sung-Ming.Lecture notes in computer science. 2002, pp 375-383, issn 0302-9743, isbn 3-540-43168-3Conference Paper

Efficient linear octree generation from voxelsRENBEN SHU; KANKANHALLI, M. S.Image and vision computing. 1994, Vol 12, Num 5, pp 297-303, issn 0262-8856Article

An Improved Algorithm for Sequence Pair GenerationMINGXU HUO; KOUBAO DING.Lecture notes in computer science. 2006, pp 482-489, issn 0302-9743, isbn 3-540-34379-2, 8 p.Conference Paper

Improved algorithms for the K-maximum subarray problem for small KBAE, Sung E; TAKAOKA, Tadao.Lecture notes in computer science. 2005, pp 621-631, issn 0302-9743, isbn 3-540-28061-8, 11 p.Conference Paper

On the strength of simply-iterated Feistel ciphers with whitening keysONIONS, Paul.Lecture notes in computer science. 2001, pp 63-69, issn 0302-9743, isbn 3-540-41898-9Conference Paper

Algorithms for deciding the containment of polygonsHERNANDEZ BARRERA, A.Information processing letters. 1996, Vol 59, Num 5, pp 261-265, issn 0020-0190Article

The complexity of equivalence for commutative ringsHUNT, H. B; STEARNS, R. E.Journal of symbolic computation. 1990, Vol 10, Num 5, pp 411-436, issn 0747-7171, 26 p.Article

A faster FPT algorithm for finding spanning trees with many leavesBONSMA, Paul S; BRUEGGEMANN, Tobias; WOEGINGER, Gerhard J et al.Lecture notes in computer science. 2003, pp 259-268, issn 0302-9743, isbn 3-540-40671-9, 10 p.Conference Paper

On finding the minimum bandwidth of interval graphsMAHESH, R; PANDU RANGAN, C; ARAVIND SRINIVASAN et al.Information and computation (Print). 1991, Vol 95, Num 2, pp 218-224, issn 0890-5401Article

  • Page / 139