Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Algorítmica")

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

Origin

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

Results 1 to 25 of 4593

  • Page / 184
Export

Selection :

  • and

Membrane computing : Current results and future problemsBERNARDINI, Francesco; GHEORGHE, Marian; KRASNOGOR, Natalio et al.Lecture notes in computer science. 2005, pp 49-53, issn 0302-9743, isbn 3-540-26179-6, 5 p.Conference Paper

Introduction : If CiE did not exist, it would be necessary to invent itCOOPER, S. Barry.Lecture notes in computer science. 2005, pp 1-7, issn 0302-9743, isbn 3-540-26179-6, 7 p.Conference Paper

Finding, counting and listing all triangles in large graphs, an experimental studySCHANK, Thomas; WAGNER, Dorothea.Lecture notes in computer science. 2005, pp 606-609, issn 0302-9743, isbn 3-540-25920-1, 4 p.Conference Paper

Algorithms - ESA 2004 (Bergen, 14-17 September 2004)Albers, Susanne; Radzik, Tomasz.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-23025-4, XVIII, 834 p, isbn 3-540-23025-4Conference Proceedings

Approximation of rectangle stabbing and interval stabbing problemsKOVALEVA, Sofia; SPIEKSMA, Frits C. R.Lecture notes in computer science. 2004, pp 426-435, issn 0302-9743, isbn 3-540-23025-4, 10 p.Conference Paper

Algorithmic aspects in information and management (Second international conference, AAIM 2006, Hong Kong, China, June 20-22, 2006)Cheng, Siu-Wing; Poon, Chung Keung.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-35157-4, 1Vol, XI-394 p, isbn 3-540-35157-4Conference Proceedings

Further reflections on a theory for basic algorithmsBORODIN, Allan.Lecture notes in computer science. 2006, pp 1-9, issn 0302-9743, isbn 3-540-35157-4, 1Vol, 9 p.Conference Paper

New computational paradigms (Amsterdam, 8-12 June 2005)Cooper, S. Barry; Löwe, Benedikt; Torenvliet, Leen et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26179-6, XVII, 574 p, isbn 3-540-26179-6Conference Proceedings

Efficient algorithms for k maximum sumsBENGTSSON, Fredrik; JINGSEN CHEN.Lecture notes in computer science. 2004, pp 137-148, issn 0302-9743, isbn 3-540-24131-0, 12 p.Conference Paper

Experimental and efficient algorithms (Santorini Island, 10-13 May 2005)Nikoletseas, Sotiris E.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-25920-1, XV, 624 p, isbn 3-540-25920-1Conference Proceedings

Categoricity in restricted classesMOROZOV, Andrey.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26179-6, p. 349Conference Paper

Recursion and complexityMOSCHOVAKIS, Yiannis N.Lecture notes in computer science. 2005, pp 350-357, issn 0302-9743, isbn 3-540-26179-6, 8 p.Conference Paper

Algorithms and computation (Hong Kong, 20-22 December 2004)Fleischeir, Rudolf; Trippen, Gerhard.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-24131-0, XVII, 935 p, isbn 3-540-24131-0Conference Proceedings

Algorithms theorye (Humlebaek, 8-10 July 2004)Hagerup, Torben; Katajainen, Jyrki.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22339-8, XI, 503 p, isbn 3-540-22339-8Conference Proceedings

Network designZHANG, Lisa.Algorithmica. 2005, Vol 43, Num 1-2, issn 0178-4617, 146 p.Serial Issue

An improved algorithm for approximate string matchingGALIL, Z; PARK, K.SIAM journal on computing (Print). 1990, Vol 19, Num 6, pp 989-999, issn 0097-5397, 11 p.Article

On the problems of definability in the enumeration degreesKALIMULLIN, Iskander Sh.Lecture notes in computer science. 2005, pp 221-222, issn 0302-9743, isbn 3-540-26179-6, 2 p.Conference Paper

Probabilités et informatique = Probabilities and information technologyPLATEAU, B.Le Courrier du C.N.R.S. 1993, Num 80, issn 0153-985X, p. 60Article

Presentations of structures in admissible setsSTUKACHEV, Alexey.Lecture notes in computer science. 2005, pp 470-478, issn 0302-9743, isbn 3-540-26179-6, 9 p.Conference Paper

The two-guard problem revisited and its generalizationXUEHOU TAN.Lecture notes in computer science. 2004, pp 847-858, issn 0302-9743, isbn 3-540-24131-0, 12 p.Conference Paper

Parallel general prefix computations with geometric, algebraic and other applicationsSPRINGSTEEL, F; STOJMENOVIC, I.International journal of parallel programming. 1989, Vol 18, Num 6, pp 485-503, issn 0885-7458, 19 p.Article

Combinatorial models of gene assemblyHARJU, Tero.Lecture notes in computer science. 2005, pp 188-195, issn 0302-9743, isbn 3-540-26179-6, 8 p.Conference Paper

Experimental algorithmics : from algorithm design to robust and efficient software (Dagstuhl, September 2000)Fleischer, Rudolf; Moret, Bernard; Meineche Schmidt, Erik et al.Lecture notes in computer science. 2002, issn 0302-9743, isbn 3-540-00346-0, XVII, 278 p, isbn 3-540-00346-0Conference Proceedings

The set of minimal braids is Co-NP-completePATERSON, M. S; RAZBOROV, A. A.Journal of algorithms (Print). 1991, Vol 12, Num 3, pp 393-408, issn 0196-6774Article

An incremental computation of convex hull of planar line intersectionsBOREDDY, J.Pattern recognition letters. 1990, Vol 11, Num 8, pp 541-543, issn 0167-8655Article

  • Page / 184