06635nam 22006495 450 99646567020331620200705163045.03-540-68580-410.1007/3-540-61440-0(CKB)1000000000234479(SSID)ssj0000321518(PQKBManifestationID)11227085(PQKBTitleCode)TC0000321518(PQKBWorkID)10279476(PQKB)11281636(DE-He213)978-3-540-68580-7(PPN)155210904(EXLCZ)99100000000023447920121227d1996 u| 0engurnn|008mamaatxtccrAutomata, Languages and Programming[electronic resource] 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings /edited by Friedhelm Meyer auf der Heide, Burkhard Monien1st ed. 1996.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1996.1 online resource (XII, 684 p.) Lecture Notes in Computer Science,0302-9743 ;1099Bibliographic Level Mode of Issuance: Monograph3-540-61440-0 Saturation-based theorem proving (abstract) -- Bandwidth efficient parallel computation -- Variable-length maximal codes -- Lower bounds for prepositional proofs and independence results in bounded arithmetic -- Algebraic characterizations of decorated trace equivalences over tree-like structures -- Fast asynchronous systems in dense time -- A hierarchy theorem for the ?-calculus -- An effective tableau system for the linear time ?-calculus -- Characterizing fairness implementability for multiparty interaction -- Termination of context-sensitive rewriting by rewriting -- A complete gentzen-style axiomatization for set constraints -- Fatal errors in conditional expressions -- Different types of arrow between logical frameworks -- Effective models of polymorphism, subtyping and recursion (extended abstract) -- Regularity for a large class of context-free processes is decidable -- On infinite transition graphs having a decidable monadic theory -- Semi-groups acting on context-free graphs -- Hard sets method and semilinear reservoir method with applications -- Random polynomials and polynomial factorization -- Optimal gröbner base algorithms for binomial ideals -- Minimum fill-in on circle and circular-arc graphs -- Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs -- Searching a fixed graph -- Improved sampling with applications to dynamic graph algorithms -- The expressive power of existential first order sentences of büchi's sequential calculus -- Fixpoints for rabin tree automata make complementation easy -- New upper bounds to the limitedness of distance automata -- Recognizing regular expressions by means of dataflow networks -- On the power of randomized branching programs -- Hitting sets derandomize BPP -- On type-2 probabilistic quantifiers -- Speeding-up single-tape nondeterministic computations by single alternation, with separation results -- On ?-generators and codes -- On standard Sturmian morphisms -- Constructions and bounds for visual cryptography -- On capital investment -- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication -- Lower bounds for row minima searching -- On the complexity of relational problems for finite state processes -- Deciding finiteness of Petri nets up to bisimulation -- Mobile processes with a distributed environment -- The meaning of negative premises in transition system specifications II -- Average case analyses of list update algorithms, with applications to data compression -- Self-organizing data structures with dependent accesses -- Lopsided trees: Analyses, algorithms, and applications -- Optimal logarithmic time randomized suffix tree construction -- Improved parallel approximation of a class of integer programming problems -- Efficient collective communication in optical networks -- Shared-memory simulations on a faulty-memory DMM -- Fast deterministic backtrack search -- Agent rendezvous: A dynamic symmetry-breaking problem -- Efficient asynchronous consensus with the value-oblivious adversary scheduler -- A formal framework for evaluating heuristic programs -- Improved scheduling algorithms for minsum criteria -- On the complexity of string folding -- A polynomial-time algorithm for near-perfect phylogeny.This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS). The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures...Lecture Notes in Computer Science,0302-9743 ;1099ComputersSoftware engineeringData structures (Computer science)CombinatoricsTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Software Engineering/Programming and Operating Systemshttps://scigraph.springernature.com/ontologies/product-market-codes/I14002Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Combinatoricshttps://scigraph.springernature.com/ontologies/product-market-codes/M29010Computers.Software engineering.Data structures (Computer science).Combinatorics.Theory of Computation.Software Engineering/Programming and Operating Systems.Data Structures.Combinatorics.004.0151Meyer auf der Heide Friedhelmedthttp://id.loc.gov/vocabulary/relators/edtMonien Burkhardedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465670203316Automata, languages and programming339738UNISA05456nam 22007575 450 99646576240331620230406051526.03-540-35461-110.1007/11780441(CKB)1000000000233028(SSID)ssj0000316696(PQKBManifestationID)11261818(PQKBTitleCode)TC0000316696(PQKBWorkID)10276691(PQKB)11420523(DE-He213)978-3-540-35461-1(MiAaPQ)EBC3068218(PPN)123136083(EXLCZ)99100000000023302820100301d2006 u| 0engurnn|008mamaatxtccrCombinatorial Pattern Matching[electronic resource] 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings /edited by Moshe Lewenstein, Gabriel Valiente1st ed. 2006.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2006.1 online resource (XII, 420 p.) Theoretical Computer Science and General Issues,2512-2029 ;4009Bibliographic Level Mode of Issuance: Monograph3-540-35455-7 Includes bibliographical references and index.Asynchronous Pattern Matching -- Asynchronous Pattern Matching -- SNP and Haplotype Analysis – Algorithms and Applications -- Identifying Co-referential Names Across Large Corpora -- Session 1. Data Structures -- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents -- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE -- Session 2. Indexing Data Structures -- A Linear Size Index for Approximate Pattern Matching -- On-Line Linear-Time Construction of Word Suffix Trees -- Obtaining Provably Good Performance from Suffix Trees in Secondary Storage -- Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures -- Session 3. Probabilistic and Algebraic Techniques -- New Bounds for Motif Finding in Strong Instances -- Fingerprint Clustering with Bounded Number of Missing Values -- Tiling an Interval of the Discrete Line -- Common Substrings in Random Strings -- Session 4. Applications in Molecular Biology I -- On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem -- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms -- Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees -- An Improved Algorithm for the Macro-evolutionary Phylogeny Problem -- Session 5. String Matching I -- Property Matching and Weighted Matching -- Faster Two Dimensional Scaled Matching -- Session 6. Applications in Molecular Biology II -- Approximation of RNA Multiple Structural Alignment -- Finding Common RNA Pseudoknot Structures in Polynomial Time -- A Compact Mathematical Programming Formulation for DNA Motif Finding -- Local Alignment of RNA Sequences with Arbitrary Scoring Schemes -- Session 7. Applications in Molecular Biology III -- An Algorithm for Sorting by Reciprocal Translocations -- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs -- Session 8. Data Compression -- A Simpler Analysis of Burrows-Wheeler Based Compression -- Statistical Encoding of Succinct Data Structures -- Dynamic Entropy-Compressed Sequences and Full-Text Indexes -- Reducing the Space Requirement of LZ-Index -- Session 9. String Matching II -- Faster Algorithms for Computing Longest Common Increasing Subsequences -- New Algorithms for Text Fingerprinting -- Sublinear Algorithms for Parameterized Matching -- Approximate Matching in Weighted Sequences -- Session 10. Dynamic Programming -- Algorithms for Finding a Most Similar Subforest -- Efficient Algorithms for Regular Expression Constrained Sequence Alignment -- Large Scale Matching for Position Weight Matrices.Theoretical Computer Science and General Issues,2512-2029 ;4009Pattern recognition systemsAlgorithmsNatural language processing (Computer science)Information storage and retrieval systemsBioinformaticsArtificial intelligence—Data processingAutomated Pattern RecognitionAlgorithmsNatural Language Processing (NLP)Information Storage and RetrievalBioinformaticsData SciencePattern recognition systems.Algorithms.Natural language processing (Computer science).Information storage and retrieval systems.Bioinformatics.Artificial intelligence—Data processing.Automated Pattern Recognition.Algorithms.Natural Language Processing (NLP).Information Storage and Retrieval.Bioinformatics.Data Science.006.4Lewenstein Mosheedthttp://id.loc.gov/vocabulary/relators/edtValiente Gabrieledthttp://id.loc.gov/vocabulary/relators/edtBOOK996465762403316Combinatorial Pattern Matching772744UNISA