Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Algorithmics")

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 251195

  • Page / 10048
Export

Selection :

  • and

CORDIC und ähnliche Algorithmen der elementaren Funktionen mit besonderer Eignung für Mikrorechner = CORDIC et des algorithmes similaires des fonctions élémentaires adaptés au microordinateur = CORDIC and similar algorithms of elementary functions adjusted to microcomputerVÖLZ, H.Nachrichtentechnik. Elektronik. 1983, Vol 33, Num 12, pp 506-510, issn 0323-4657Article

A method for the computation of inertial properties for general areasMILES, R. G; TOUGH, J. G.Computer-aided design. 1983, Vol 15, Num 4, pp 196-200, issn 0010-4485Article

An improved algorithm hierarchical clustering using strong componentsTARJAN, R. E.Information processing letters. 1983, Vol 17, Num 1, pp 37-41, issn 0020-0190Article

An efficient algorithm for finding Kleene closure of regular expression matricesLEE, E. T.International journal of computer & information sciences. 1982, Vol 11, Num 6, pp 409-415, issn 0091-7036Article

A fast heuristic based on spacefilling curves for minimum-weight matching in the planeBARTHOLDI, J. J; PLATZMAN, L. K.Information processing letters. 1983, Vol 17, Num 4, pp 177-180, issn 0020-0190Article

CAAP '83. Trees in algebra and programming. 8th. Colloquium, L'Aquila, March 9-11, 1983. ProceedingsAUSIELLO, G; PROTASI, M.Lecture notes in computer science. 1983, Vol 159, issn 0302-9743, VI-416 pConference Proceedings

A description method of iterative patternsASO, H; HONDA, N.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1983, Vol 66, Num 4, pp 234-240, issn 0387-236XArticle

A note on the characterization of the max and min operatorsVOXMAN, W; GOETSCHEL, R.Information sciences. 1983, Vol 30, Num 1, pp 5-10, issn 0020-0255Article

Cost trade-offs in graph embeddings, with applicationsJIA-WEI HONG; MEHLHORN, K; ROSENBERG, A. L et al.Journal of the Association for Computing Machinery. 1983, Vol 30, Num 4, pp 709-728, issn 0004-5411Article

The symmetric all-furthest-neighbor problemTOUSSAINT, G. T.Computers & mathematics with applications. 1983, Vol 9, Num 6, pp 747-754, issn 0097-4943Article

Computing normalizers in permutation groupsBUTLER, G.Journal of algorithms (Print). 1983, Vol 4, Num 2, pp 163-175, issn 0196-6774Article

Dynamic cycle detectionSHMUELI, O.Information processing letters. 1983, Vol 17, Num 4, pp 185-188, issn 0020-0190Article

Efficient construction of balanced binary treesEVANS, D. J; ABDOLLAHZADEH, F.Computer journal (Print). 1983, Vol 26, Num 3, pp 193-195, issn 0010-4620Article

Invariant properties of the shuffle-exchange and a simplified cost-effective version of the omega networkSTEINBERG, D.IEEE transactions on computers. 1983, Vol 32, Num 5, pp 444-450, issn 0018-9340Article

Shifting algorithms for tree partitioning with general weighting functionsBECKER, R. I.Journal of algorithms (Print). 1983, Vol 4, Num 2, pp 101-120, issn 0196-6774Article

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

PRIMALITY TESTING AND FACTORINGFINN J; LIEBERHERR K.1983; THEORETICAL COMPUTER SCIENCES; ISSN 0304-3975; NLD; DA. 1983; VOL. 23; NO 2; PP. 211-215; BIBL. 6 REF.Article

A RAPID LOOKUP TABLE METHOD FOR TRIGONOMETRIC FUNCTIONSSEWELL BT.1982; SOFTW. PRACT. EXP.; ISSN 0038-0644; GBR; DA. 1982; VOL. 12; NO 10; PP. 885-887; BIBL. 1 REF.Article

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

A distributed algorithm for minimum weight directed spanning treesHUMBLET, P. A.IEEE transactions on communications. 1983, Vol 31, Num 6, pp 756-762, issn 0090-6778Article

Number theoretic transform based on ternary arithmetic and its application to cyclic convolutionBALLA, P. C; ANTONIOU, A.IEEE transactions on circuits and systems. 1983, Vol 30, Num 7, pp 504-505, issn 0098-4094Article

An efficient external sorting with minimal space requirementMOTZKIN, D; HANSEN, C. L.International journal of computer & information sciences. 1982, Vol 11, Num 6, pp 381-396, issn 0091-7036Article

  • Page / 10048