Přeskočit na obsah
Library Home
Start Over
Research Databases
E-Journals
Rezervace kurzů
Library Home
Přihlásit
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Jazyk
Library Catalog
Vše
Název
Autor
Téma
Signatura
ISBN/ISSN
Hledat
Pokročilé vyhledávání
|
Procházet
|
Tipy pro vyhledávání
LATIN'98: Theoretical Informat...
Vytvořit citaci
Zaslat SMS
Poslat e-mailem
Vytisknout
Exportovat záznam
Exportovat do RefWorks
Exportovat do EndNoteWeb
Exportovat do EndNote
Přidat do oblíbených
Trvalý odkaz
LATIN'98: Theoretical Informatics Third Latin American Symposium, Campinas, Brazil, April 20-24, 1998, Proceedings / edited by Claudio L. Lucchesi, Arnaldo V. Moura.
Uloženo v:
Podrobná bibliografie
Korporativní autor:
SpringerLink (Online service)
Další autoři:
Lucchesi, Claudio L.
(Editor)
,
Moura, Arnaldo V.
(Editor)
Médium:
E-kniha
Jazyk:
English
Vydáno:
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
1998.
Vydání:
1st ed. 1998.
Edice:
Lecture Notes in Computer Science,
1380
Springer eBook Collection.
Témata:
Computers.
Data encryption (Computer science).
Computer science—Mathematics.
Numerical analysis.
Electronic resources (E-books)
On-line přístup:
Click to view e-book
Holy Cross Note:
Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Jednotky
Popis
Obsah
Podobné jednotky
UNIMARC/MARC
Obsah:
Analysis of Rabin's polynomial irreducibility test
A chip search problem on binary numbers
Uniform service systems with k servers
Faster non-linear parametric search with applications to optimization and dynamic geometry
Super-state automata and rational trees
An Eilenberg theorem for words on countable ordinals
Maximal groups in free Burnside semigroups
Positive varieties and infinite words
Unfolding parametric automata
Fundamental structures in Well-Structured infinite Transition Systems
Shape reconstruction with Delaunay complex
Bases for non-homogeneous polynomial C k splines on the sphere
The splitting number of the 4-cube
Short and smooth polygonal paths
Quantum cryptanalysis of hash and claw-free functions
Batch verification with applications to cryptography and checking
Strength of two Data Encryption Standard implementations under timing attacks
Spectral techniques in graph algorithms
Colouring graphs whose chromatic number is almost their maximum degree
Circuit covers in series-parallel mixed graphs
A linear time algorithm to recognize clustered planar graphs and its parallelization
A new characterization for parity graphs and a coloring problem with costs
On the clique operator
Dynamic packet routing on arrays with bounded buffers
On-Line matching routing on trees
Analyzing Glauber dynamics by comparison of Markov chains
The CREW PRAM complexity of modular inversion
Communication-efficient parallel multiway and approximate minimum cut computation
The geometry of browsing
Fast two-dimensional approximate pattern matching
Improved approximate pattern matching on hypertext
Solving equations in strings: On Makanin's algorithm
Spelling approximate repeated or common motifs using a suffix tree.
Podobné jednotky
STACS 98 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings
Vydáno: (1998)
LATIN 2004: Theoretical Informatics 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings
Vydáno: (2004)
LATIN 2002: Theoretical Informatics 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings
Vydáno: (2002)
LATIN 2012: Theoretical Informatics 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012, Proceedings
Vydáno: (2012)
Algorithmic Number Theory 5th International Symposium, ANTS-V, Sydney, Australia, July 7-12, 2002. Proceedings
Vydáno: (2002)