Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata, languages and programming : 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings / / JiriÌ Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors)
| Automata, languages and programming : 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings / / JiriÌ Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XIV, 726 p.) |
| Disciplina | 005.13 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Programming languages (Electronic computers)
Machine theory Formal languages |
| ISBN | 3-540-48523-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Generating Hard Instances of the Short Basis Problem -- Wide Area Computation -- Proof Techniques for Cryptographic Protocols -- Type Structure for Low-Level Programming Languages -- Real Computations with Fake Numbers -- A Model for Associative Memory, a Basis for Thinking and Consciousness -- Numerical Integration with Exact Real Arithmetic -- Observations about the Nature and State of Computer Science -- DNA Computing: New Ideas and Paradigms -- Online Data Structures in External Memory -- From Computational Learning Theory to Discovery Science -- Contributed Papers -- Bounded Depth Arithmetic Circuits: Counting and Closure -- Parametric Temporal Logic for “Model Measuring” -- Communicating Hierarchical State Machines -- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs -- General Morphisms of Petri Nets (Extended Abstract) -- On Some Tighter Inapproximability Results (Extended Abstract) -- Decomposition and Composition of Timed Automata -- New Applications of the Incompressibility Method (Extended Abstract) -- Mobility Types for Mobile Ambients -- Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains -- Decidable Fragments of Simultaneous Rigid Reachability -- Text Compression Using Antidictionaries -- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract) -- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem -- Space-Time Tradeoffs for Graph Properties -- Boundedness of Reset P/T Nets -- Two-way finite state transducers and monadic second-order logic -- Partially Ordered Regular Languages for Graph Queries -- Deciding First-Order Properties of Locally Tree-Decomposable Graphs -- Comparison of Process Algebra Equivalences Using Formats -- Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract) -- Computing LOGCFL Certificates -- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract) -- On the Complements of Partial k-Trees -- Approximation Results for Kinetic Variants of TSP -- Distributed Probabilistic Polling and Applications to Proportionate Agreement -- Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract) -- A Framework for Decidable Metrical Logics -- On the Power of Las Vegas II. Two-Way Finite Automata -- Stable Marriage with Incomplete Lists and Ties -- Average-Case Complexity of Shellsort (Preliminary Version) -- Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract) -- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract) -- Two Techniques in the Area of the Star Problem -- Approximations by OBDDs and the Variable Ordering Problem -- Simulation Preorder on Simple Process Algebras -- Solos in Concert -- Shortest Anisotropic Paths on Terrains -- Relations between Local and Global Periodicity of Words (Extended Abstract) -- Efficient Merging, Construction, and Maintenance of Evolutionary Trees -- Formalizing a Lazy Substitution Proof System for ?-Calculus in the Calculus of Inductive Constructions -- Leader Election by d Dimensional Cellular Automata -- New Upper Bounds for MaxSat -- Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ? -- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time -- Finite Automata with Generalized Acceptance Criteria -- A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract) -- Closed Freyd- and ?-categories -- Typed Exceptions and Continuations Cannot Macro-Express Each Other -- Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract) -- Accessing Multiple Sequences Through Set Associative Caches -- T(A) = T(B)? -- Many-Valued Logics and Holographic Proofs -- On the Complexity and Inapproximability of Shortest Implicant Problems -- The Wave Propagator Is Turing Computable -- An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract) -- Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices. |
| Record Nr. | UNINA-9910143456003321 |
| Berlin : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Automata, languages and programming : 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings / / JiriÌ Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors)
| Automata, languages and programming : 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings / / JiriÌ Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors) |
| Edizione | [1st ed. 1999.] |
| Pubbl/distr/stampa | Berlin : , : Springer, , [1999] |
| Descrizione fisica | 1 online resource (XIV, 726 p.) |
| Disciplina | 005.13 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Programming languages (Electronic computers)
Machine theory Formal languages |
| ISBN | 3-540-48523-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Generating Hard Instances of the Short Basis Problem -- Wide Area Computation -- Proof Techniques for Cryptographic Protocols -- Type Structure for Low-Level Programming Languages -- Real Computations with Fake Numbers -- A Model for Associative Memory, a Basis for Thinking and Consciousness -- Numerical Integration with Exact Real Arithmetic -- Observations about the Nature and State of Computer Science -- DNA Computing: New Ideas and Paradigms -- Online Data Structures in External Memory -- From Computational Learning Theory to Discovery Science -- Contributed Papers -- Bounded Depth Arithmetic Circuits: Counting and Closure -- Parametric Temporal Logic for “Model Measuring” -- Communicating Hierarchical State Machines -- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs -- General Morphisms of Petri Nets (Extended Abstract) -- On Some Tighter Inapproximability Results (Extended Abstract) -- Decomposition and Composition of Timed Automata -- New Applications of the Incompressibility Method (Extended Abstract) -- Mobility Types for Mobile Ambients -- Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains -- Decidable Fragments of Simultaneous Rigid Reachability -- Text Compression Using Antidictionaries -- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract) -- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem -- Space-Time Tradeoffs for Graph Properties -- Boundedness of Reset P/T Nets -- Two-way finite state transducers and monadic second-order logic -- Partially Ordered Regular Languages for Graph Queries -- Deciding First-Order Properties of Locally Tree-Decomposable Graphs -- Comparison of Process Algebra Equivalences Using Formats -- Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract) -- Computing LOGCFL Certificates -- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract) -- On the Complements of Partial k-Trees -- Approximation Results for Kinetic Variants of TSP -- Distributed Probabilistic Polling and Applications to Proportionate Agreement -- Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract) -- A Framework for Decidable Metrical Logics -- On the Power of Las Vegas II. Two-Way Finite Automata -- Stable Marriage with Incomplete Lists and Ties -- Average-Case Complexity of Shellsort (Preliminary Version) -- Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract) -- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract) -- Two Techniques in the Area of the Star Problem -- Approximations by OBDDs and the Variable Ordering Problem -- Simulation Preorder on Simple Process Algebras -- Solos in Concert -- Shortest Anisotropic Paths on Terrains -- Relations between Local and Global Periodicity of Words (Extended Abstract) -- Efficient Merging, Construction, and Maintenance of Evolutionary Trees -- Formalizing a Lazy Substitution Proof System for ?-Calculus in the Calculus of Inductive Constructions -- Leader Election by d Dimensional Cellular Automata -- New Upper Bounds for MaxSat -- Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ? -- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time -- Finite Automata with Generalized Acceptance Criteria -- A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract) -- Closed Freyd- and ?-categories -- Typed Exceptions and Continuations Cannot Macro-Express Each Other -- Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract) -- Accessing Multiple Sequences Through Set Associative Caches -- T(A) = T(B)? -- Many-Valued Logics and Holographic Proofs -- On the Complexity and Inapproximability of Shortest Implicant Problems -- The Wave Propagator Is Turing Computable -- An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract) -- Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices. |
| Record Nr. | UNISA-996465735103316 |
| Berlin : , : Springer, , [1999] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
SOFSEM 2004: Theory and Practice of Computer Science : 30th Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 24-30, 2004 / / edited by Peter Van Emde Boas, Jaroslav Pokorny, Mária Bieliková, Julius Stuller
| SOFSEM 2004: Theory and Practice of Computer Science : 30th Conference on Current Trends in Theory and Practice of Computer Science, Merin, Czech Republic, January 24-30, 2004 / / edited by Peter Van Emde Boas, Jaroslav Pokorny, Mária Bieliková, Julius Stuller |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIII, 385 p.) |
| Disciplina | 005.4/465 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Database management Application software Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Database Management Information Systems Applications (incl. Internet) |
| ISBN |
1-280-30664-5
9786610306640 3-540-24618-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Games, Theory and Applications -- Database Research Issues in a WWW and GRIDs World -- Integration, Diffusion, and Merging in Information Management Discipline -- Flexibility through Multiagent Systems: Solution or Illusion? -- World Wide Web Challenges: Supporting Users in Search and Navigation -- Querying and Viewing the Semantic Web: An RDF-Based Perspective -- Knowledge Acquisition and Processing: New Methods for Neuro-Fuzzy Systems -- Algorithms for Scalable Storage Servers -- Fuzzy Unification and Argumentation for Well-Founded Semantics -- Tree Signatures and Unordered XML Pattern Matching -- Regular Papers -- Quantum Query Complexity for Some Graph Problems -- A Model of Versioned Web Sites -- Design of Secure Multicast Models for Mobile Services -- Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints -- Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances -- Validity Conditions in Agreement Problems and Time Complexity -- Supporting Evolution in Workflow Definition Languages -- Clustered Level Planarity -- Artificial Perception: Auditory Decomposition of Mixtures of Environmental Sounds – Combining Information Theoretical and Supervised Pattern Recognition Approaches -- Features of Neighbors Spaces -- Discovery of Lexical Entries for Non-taxonomic Relations in Ontology Learning -- Approaches Based on Markovian Architectural Bias in Recurrent Neural Networks -- Processing XPath Expressions in Relational Databases -- An Embedded Language Approach to Router Specification in Curry -- Multi-document Automatic Text Summarization Using Entropy Estimates -- Implicit Flow Maximization by Iterative Squaring -- Evolving Constructors for Infinitely Growing Sorting Networks and Medians -- Fuzzy Group Models for Adaptation in Cooperative Information Retrieval Contexts -- Theory of One Tape Linear Time Turing Machines -- Avoiding Forbidden Submatrices by Row Deletions -- Building a Bridge between Mirror Neurons and Theory of Embodied Cognition -- The Best Student Paper -- Fully Truthful Mechanisms. |
| Record Nr. | UNINA-9910144209103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
SOFSEM 2013: Theory and practice of computer science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlyn, Czech Republic, January 26-31, 2013. Proceedings / / Peter van Emde Boas ...[et al.] (eds.)
| SOFSEM 2013: Theory and practice of computer science : 39th International Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlyn, Czech Republic, January 26-31, 2013. Proceedings / / Peter van Emde Boas ...[et al.] (eds.) |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2013 |
| Descrizione fisica | 1 online resource (XIV, 566 p. 131 illus.) |
| Disciplina | 004.0151 |
| Altri autori (Persone) | Emde BoasP. van |
| Collana |
Lecture notes in computer science
LNCS sublibrary |
| Soggetto topico |
Computer science
Computer systems |
| ISBN | 3-642-35842-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Major Achievements in Software Studies -- Foundations of Computer Science -- Software and Web Engineering -- Data, Information and Knowledge Engineering -- Social Computing and Human Factors -- Foundations of Computer Science -- Software and Web Engineering -- Data, Information, and Knowledge Engineering -- Social Computing and Human Factors. |
| Record Nr. | UNINA-9910739486503321 |
| Berlin ; ; New York, : Springer, c2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||