000 05382nam a22005775i 4500
001 978-3-540-45995-8
003 DE-He213
005 20160624102010.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 _a9783540459958
_9978-3-540-45995-8
024 7 _a10.1007/3-540-45995-2
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aLATIN 2002: Theoretical Informatics
_h[electronic resource] :
_b5th Latin American Symposium Cancun, Mexico, April 3–6, 2002 Proceedings /
_cedited by Sergio Rajsbaum.
260 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2002.
300 _aXIV, 638 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2286
505 0 _aInvited Talks and Tutorials -- Phase Transitions in Computer Science -- The Internet, the Web, and Algorithms -- Erd?s Magic -- Open Problems in Computational Geometry -- Quantum Algorithms -- Testing and Checking of Finite State Systems -- From Algorithms to Cryptography Tutorial -- Dihomotopy as a Tool in State Space Analysis Tutorial -- Regular Contributions -- Algorithms for Local Alignment with Length Constraints* -- An Algorithm That Builds a Set of Strings Given Its Overlap Graph -- Conversion between Two Multiplicatively Dependent Linear Numeration Systems -- Star Height of Reversible Languages and Universal Automata -- Weakly Iterated Block Products of Finite Monoids -- The Hidden Number Problem in Extension Fields and Its Applications -- The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves -- Random Partitions with Non Negative rth Differences -- Beta-Expansions for Cubic Pisot Numbers -- Facility Location Constrained to a Polygonal Domain -- A Deterministic Polynomial Time Algorithm for Heilbronn’s Problem in Dimension Three -- A Metric Index for Approximate String Matching -- On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm -- On the Power of BFS to Determine a Graphs Diameter -- k-pseudosnakes in Large Grids -- L(2, 1)-Coloring Matrogenic Graphs -- Pipeline Transportation of Petroleum Products with No Due Dates -- Ancestor Problems on Pure Pointer Machines -- Searching in Random Partially Ordered Sets -- Packing Arrays -- Generalized Shannon Code Minimizes the Maximal Redundancy -- An Improved Algorithm for Sequence Comparison with Block Reversals -- Pattern Matching and Membership for Hierarchical Message Sequence Charts -- Improved Exact Algorithms for Max-Sat -- Characterising Strong Normalisation for Explicit Substitutions -- Parameters in Pure Type Systems -- Category, Measure, Inductive Inference: A Triality Theorem and Its Applications -- Verification of Embedded Reactive Fiffo Systems -- Electronic Jury Voting Protocols -- Square Roots Modulo p -- Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities -- Signals for Cellular Automata in Dimension 2 or Higher -- Holographic Trees -- On the Spanning Ratio of Gabriel Graphs and ?-skeletons -- In-Place Planar Convex Hull Algorithms -- The Level Ancestor Problem Simplified -- Flow Metrics -- On Logical Descriptions of Regular Languages -- Computing Boolean Functions from Multiple Faulty Copies of Input Bits -- Inapproximability Results on Stable Marriage Problems -- Tight Bounds for Online Class-Constrained Packing -- On-line Algorithms for Edge-Disjoint Paths in Trees of Rings -- Massive Quasi-Clique Detection -- Improved Tree Decomposition Based Algorithms for Domination-like Problems.
520 _aThis book constitutes the refereed proceedings of the 5th International Symposium, Latin American Theoretical Informatics, LATIN 2002, held in Cancun, Mexico, in April 2002. The 44 revised full papers presented together with a tutorial and 7 abstracts of invited contributions were carefully reviewed and selected from a total of 104 submissions. The papers presented are devoted to a broad range of topics from theoretical computer science and mathematical foundations, with a certain focus on algorithmics and computations related to discrete structures.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aData encryption (Computer science).
650 0 _aInformation theory.
650 0 _aComputer software.
650 0 _aComputational complexity.
650 0 _aComputer graphics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aTheory of Computation.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aData Structures.
650 2 4 _aComputer Graphics.
650 2 4 _aData Encryption.
700 1 _aRajsbaum, Sergio.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783540434009
786 _dSpringer
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v2286
856 4 0 _uhttp://dx.doi.org/10.1007/3-540-45995-2
942 _2EBK5656
_cEBK
999 _c34950
_d34950