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.
Algorithmic Learning Theory [[electronic resource] ] : 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings / / edited by Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk
| Algorithmic Learning Theory [[electronic resource] ] : 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings / / edited by Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 420 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Computer programming
Computers Artificial intelligence Computer science Algorithms Programming Techniques Theory of Computation Artificial Intelligence Computer Science, general Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-36169-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Mathematics Based on Learning -- Data Mining with Graphical Models -- On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum -- In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project -- Learning Structure from Sequences, with Applications in a Digital Library -- Regular Contributions -- On Learning Monotone Boolean Functions under the Uniform Distribution -- On Learning Embedded Midbit Functions -- Maximizing Agreements and CoAgnostic Learning -- Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning -- Large Margin Classification for Moving Targets -- On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution -- A General Dimension for Approximately Learning Boolean Functions -- The Complexity of Learning Concept Classes with Polynomial General Dimension -- On the Absence of Predictive Complexity for Some Games -- Consistency Queries in Information Extraction -- Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data -- Reflective Inductive Inference of Recursive Functions -- Classes with Easily Learnable Subclasses -- On the Learnability of Vector Spaces -- Learning, Logic, and Topology in a Common Framework -- A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning -- Minimised Residue Hypotheses in Relevant Logic -- Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages -- A Negative Result on Inductive Inference of Extended Pattern Languages -- RBF Neural Networks and Descartes’ Rule of Signs -- Asymptotic Optimality of Transductive Confidence Machine -- An Efficient PAC Algorithm for Reconstructing a Mixture of Lines -- Constraint Classification: A New Approach to Multiclass Classification -- How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution -- Classification with Intersecting Rules -- Feedforward Neural Networks in Reinforcement Learning Applied to High-Dimensional Motor Control. |
| Record Nr. | UNISA-996465507003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic Learning Theory : 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings / / edited by Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk
| Algorithmic Learning Theory : 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002, Proceedings / / edited by Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 420 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Computer programming
Computers Artificial intelligence Computer science Algorithms Programming Techniques Theory of Computation Artificial Intelligence Computer Science, general Computation by Abstract Devices Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-36169-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Editors’ Introduction -- Editors’ Introduction -- Invited Papers -- Mathematics Based on Learning -- Data Mining with Graphical Models -- On the Eigenspectrum of the Gram Matrix and Its Relationship to the Operator Eigenspectrum -- In Search of the Horowitz Factor: Interim Report on a Musical Discovery Project -- Learning Structure from Sequences, with Applications in a Digital Library -- Regular Contributions -- On Learning Monotone Boolean Functions under the Uniform Distribution -- On Learning Embedded Midbit Functions -- Maximizing Agreements and CoAgnostic Learning -- Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning -- Large Margin Classification for Moving Targets -- On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution -- A General Dimension for Approximately Learning Boolean Functions -- The Complexity of Learning Concept Classes with Polynomial General Dimension -- On the Absence of Predictive Complexity for Some Games -- Consistency Queries in Information Extraction -- Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data -- Reflective Inductive Inference of Recursive Functions -- Classes with Easily Learnable Subclasses -- On the Learnability of Vector Spaces -- Learning, Logic, and Topology in a Common Framework -- A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning -- Minimised Residue Hypotheses in Relevant Logic -- Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages -- A Negative Result on Inductive Inference of Extended Pattern Languages -- RBF Neural Networks and Descartes’ Rule of Signs -- Asymptotic Optimality of Transductive Confidence Machine -- An Efficient PAC Algorithm for Reconstructing a Mixture of Lines -- Constraint Classification: A New Approach to Multiclass Classification -- How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution -- Classification with Intersecting Rules -- Feedforward Neural Networks in Reinforcement Learning Applied to High-Dimensional Motor Control. |
| Record Nr. | UNINA-9910143891203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Fundamentals of Computation Theory [[electronic resource] ] : 15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings / / edited by Maciej Liskiewicz, Rüdiger Reischuk
| Fundamentals of Computation Theory [[electronic resource] ] : 15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings / / edited by Maciej Liskiewicz, Rüdiger Reischuk |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVI, 580 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Machine theory Computer science—Mathematics Discrete mathematics Computer graphics Theory of Computation Formal Languages and Automata Theory Discrete Mathematics in Computer Science Computer Graphics |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- The Complexity of Querying External Memory and Streaming Data -- The Smoothed Analysis of Algorithms -- Path Coupling Using Stopping Times -- Circuits -- On the Incompressibility of Monotone DNFs -- Bounds on the Power of Constant-Depth Quantum Circuits -- Automata I -- Biautomatic Semigroups -- Deterministic Automata on Unranked Trees -- Complexity I -- Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals -- Generic Density and Small Span Theorem -- Approximability -- Logspace Optimization Problems and Their Approximability Properties -- A Faster and Simpler 2-Approximation Algorithm for Block Sorting -- Computational and Structural Complexity -- On the Power of Unambiguity in Alternating Machines -- Translational Lemmas for Alternating TMs and PRAMs -- Collapsing Recursive Oracles for Relativized Polynomial Hierarchies -- Graphs and Complexity -- Exact Algorithms for Graph Homomorphisms -- Improved Algorithms and Complexity Results for Power Domination in Graphs -- Clique-Width for Four-Vertex Forbidden Subgraphs -- Computational Game Theory -- On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems -- Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems -- Visual Cryptography and Computational Geometry -- Perfect Reconstruction of Black Pixels Revisited -- Adaptive Zooming in Point Set Labeling -- Query Complexity -- On the Black-Box Complexity of Sperner’s Lemma -- Property Testing and the Branching Program Size of Boolean Functions -- Distributed Systems -- Almost Optimal Explicit Selectors -- The Delayed k-Server Problem -- Automata and Formal Languages -- Leftist Grammars and the Chomsky Hierarchy -- Shrinking Multi-pushdown Automata -- Graph Algorithms -- A Simple and Fast Min-cut Algorithm -- (Non)-Approximability for the Multi-criteria TSP(1,2) -- Semantics -- Completeness and Compactness of Quantitative Domains -- A Self-dependency Constraint in the Simply Typed Lambda Calculus -- A Type System for Computationally Secure Information Flow -- Approximation Algorithms -- Algorithms for Graphs Embeddable with Few Crossings Per Edge -- Approximation Results for the Weighted P 4 Partition Problems -- The Maximum Resource Bin Packing Problem -- Average-Case Complexity -- Average-Case Non-approximability of Optimisation Problems -- Relations Between Average-Case and Worst-Case Complexity -- Algorithms -- Reconstructing Many Partitions Using Spectral Techniques -- Constant Time Generation of Linear Extensions -- Complexity II -- On Approximating Real-World Halting Problems -- An Explicit Solution to Post’s Problem over the Reals -- The Complexity of Semilinear Problems in Succinct Representation -- Graph Algorithms -- On Finding Acyclic Subhypergraphs -- An Improved Approximation Algorithm for TSP with Distances One and Two -- New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem -- Automata II -- On the Expressiveness of Asynchronous Cellular Automata -- Tree Automata and Discrete Distributed Games -- Pattern Matching -- A New Linearizing Restriction in the Pattern Matching Problem -- Fully Incremental LCS Computation. |
| Record Nr. | UNISA-996465884803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers / / edited by Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers / / edited by Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XX, 430 p. 114 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Geometry Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-642-45043-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tree-Like Structures in Graphs: A Metric Point of View -- Overview of New Approaches for Approximating TSP -- Linear Rank-Width and Linear Clique-Width of Trees -- Threshold-Coloring and Unit-Cube Contact Representation of Graphs -- Rolling Upward Planarity Testing of Strongly Connected Graphs -- Towards a Provably Resilient Scheme for Graph-Based Watermarking -- The Normal Graph Conjecture for Classes of Sparse Graphs -- On the Parameterized Complexity of Computing Graph Bisections -- Fixed-Parameter Tractability and Characterizations of Small Special Treewidth -- The θ5-Graph is a Spanner -- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations (Extended Abstract) -- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs -- Equilateral L-Contact Graphs -- Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees -- Linear Separation of Total Dominating Sets in Graphs -- Sparse Square Roots -- Completing Colored Graphs to Meet a Target Property -- Colouring of Graphs with Ramsey-Type Forbidden Subgraphs -- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs -- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time -- Thickness and Colorability of Geometric Graphs -- The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube -- FPT Is Characterized by Useful Obstruction Sets -- Excluding Graphs as Immersions in Surface Embedded -- OBDD-Based Representation of Interval Graphs -- Tight Upper Bounds for Minimum Feedback Arc Sets of Regular -- A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem -- On Retracts, Absolute Retracts, and Folds in Cographs -- Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(log log n) Colors -- On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs -- Certifying 3-Edge-Connectivity -- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs -- Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs -- Beyond Knights and Knaves -- Drawing Graphs with Few Arcs -- Connecting Terminals and 2-Disjoint Connected Subgraphs. |
| Record Nr. | UNISA-996465641303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers / / edited by Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk
| Graph-Theoretic Concepts in Computer Science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers / / edited by Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XX, 430 p. 114 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Geometry Discrete Mathematics in Computer Science Data Science |
| ISBN | 3-642-45043-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Tree-Like Structures in Graphs: A Metric Point of View -- Overview of New Approaches for Approximating TSP -- Linear Rank-Width and Linear Clique-Width of Trees -- Threshold-Coloring and Unit-Cube Contact Representation of Graphs -- Rolling Upward Planarity Testing of Strongly Connected Graphs -- Towards a Provably Resilient Scheme for Graph-Based Watermarking -- The Normal Graph Conjecture for Classes of Sparse Graphs -- On the Parameterized Complexity of Computing Graph Bisections -- Fixed-Parameter Tractability and Characterizations of Small Special Treewidth -- The θ5-Graph is a Spanner -- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations (Extended Abstract) -- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs -- Equilateral L-Contact Graphs -- Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees -- Linear Separation of Total Dominating Sets in Graphs -- Sparse Square Roots -- Completing Colored Graphs to Meet a Target Property -- Colouring of Graphs with Ramsey-Type Forbidden Subgraphs -- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs -- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time -- Thickness and Colorability of Geometric Graphs -- The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube -- FPT Is Characterized by Useful Obstruction Sets -- Excluding Graphs as Immersions in Surface Embedded -- OBDD-Based Representation of Interval Graphs -- Tight Upper Bounds for Minimum Feedback Arc Sets of Regular -- A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem -- On Retracts, Absolute Retracts, and Folds in Cographs -- Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(log log n) Colors -- On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs -- Certifying 3-Edge-Connectivity -- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs -- Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs -- Beyond Knights and Knaves -- Drawing Graphs with Few Arcs -- Connecting Terminals and 2-Disjoint Connected Subgraphs. |
| Record Nr. | UNINA-9910484021603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 96 [[electronic resource] ] : 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996. Proceedings / / edited by Claude Puech, Rüdiger Reischuk
| STACS 96 [[electronic resource] ] : 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996. Proceedings / / edited by Claude Puech, Rüdiger Reischuk |
| Edizione | [1st ed. 1996.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
| Descrizione fisica | 1 online resource (XII, 690 p.) |
| Disciplina | 004/.01/511 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Algorithms Computer logic Mathematical logic Computer programming Theory of Computation Computation by Abstract Devices Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages Programming Techniques |
| ISBN | 3-540-49723-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | New trends in quantum computing -- Compressibility and resource bounded measure -- On the complexity of random strings -- Remarks on generalized Post Correspondence Problem -- Cyclic languages and strongly cyclic languages -- Resource-bounded balanced genericity, stochasticity and weak randomness -- The complexity of generating and checking proofs of membership -- Observations on measure and lowness for ? 2 P -- Solvable black-box group problems are low for PP -- Languages recognized by finite aperiodic groupoids -- Star-height of an N-rational series -- An aperiodic set of Wang cubes -- Lyndon factorization of infinite words -- Embedding graphs with bounded treewidth into optimal hypercubes -- Parallel comparability graph recognition and modular decomposition -- Fault-tolerant shared memory simulations -- On word-level parallelism in fault-tolerant computing -- Learning with confidence -- Extracting best consensus motifs from positive and negative examples -- PAC learning with simple examples -- General inductive inference types based on linearly-ordered sets -- On the power of non-observable actions in timed automata -- Trace rewriting: Computing normal forms in time O(n log n) -- A decision procedure for well-formed linear quantum cellular automata -- On the complexity of worst case and expected time in a circuit -- On the existence of hard sparse sets under weak reductions -- Optimal bounds on the approximation of boolean functions with consequences on the concept of hardness -- Fine separation of average time complexity classes -- Compositional specification of timed systems -- Optimal tree-based one-time digital signature schemes -- The action of a few random permutations on r-tuples and an application to cryptography -- A unified and generalized treatment of authentication theory -- Monadic second order logic on tree-like structures -- On bijections vs. unary functions -- The 3 Frenchmen method proves undecidability of the uniform boundedness for single recursive rule ternary DATALOG Programs -- A combinatorial design approach to MAXCUT -- Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width -- A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume -- On the expressivity of the modal mu-calculus -- Read-once projections and formal circuit verification with binary decision diagrams -- “Optimal” collecting semantics for analysis in a hierarchy of logic program semantics -- Flip-flop nets -- Lower bounds for compact routing -- On the successor function in non-classical numeration systems -- Minimal forbidden words and symbolic dynamics -- Universal hashing and k-wise independent random variables via integer arithmetic without primes -- Ranking and unranking trees using regular reductions -- On competitive on-line paging with lookahead -- Hypothesis testing in perfect phylogeny for a bounded number of characters -- The “log rank” conjecture for modular communication complexity -- Upper bounds on multiparty communication complexity of shifts -- Some bounds on multiparty communication complexity of pointer jumping -- Optimal schedules for d-D grid graphs with communication delays -- Linear programming — Randomization and abstract frameworks. |
| Record Nr. | UNISA-996465860003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 97 [[electronic resource] ] : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings / / edited by Rüdiger Reischuk, Michel Morvan
| STACS 97 [[electronic resource] ] : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings / / edited by Rüdiger Reischuk, Michel Morvan |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XV, 621 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Programming languages (Electronic computers) Computer science—Mathematics Theory of Computation Programming Techniques Programming Languages, Compilers, Interpreters Discrete Mathematics in Computer Science |
| ISBN | 3-540-68342-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Unifying models -- Predecessor queries in dynamic integer sets -- Semi-dynamic shortest paths and breadth-first search in digraphs -- Greibach normal form transformation, revisited -- Translating regular expressions into small ?-free nondeterministic finite automata -- Memory management for Union-Find algorithms -- Fast online multiplication of real numbers -- The operators min and max on the polynomial hierarchy -- Resource-bounded kolmogorov complexity revisited -- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations -- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes -- MODp-tests, almost independence and small probability spaces -- Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification -- Temporal logics for the specification of performance and reliability -- Efficient scaling-invariant checking of timed bisimulation -- Gossiping and broadcasting versus computing functions in networks -- On the descriptive and algorithmic power of parity ordered binary decision diagrams -- A reducibility concept for problems defined in terms of ordered binary decision diagrams -- On the classification of computable languages -- A conditional-logical approach to minimum cross-entropy -- Undecidability results on two-variable logics -- Methods and applications of (max,+) linear algebra -- Regular expressions and context-free grammars for picture languages -- Measuring nondeterminism in pushdown automata -- On polynomially D verbose sets -- A downward translation in the polynomial hierarchy -- Strict sequential P-completeness -- An unambiguous class possessing a complete set -- Deadlock-free interval routing schemes -- Power consumption in packet radio networks -- The complexity of generating test instances -- Efficient constructions of Hitting Sets for systems of linear functions -- Protocols for collusion-secure asymmetric fingerprinting -- Minimal transition systems for history-preserving bisimulation -- On ergodic linear cellular automata over Zm -- Intrinsic universality of a 1-dimensional reversible Cellular Automaton -- The computational complexity of some problems of linear algebra -- Algebraic and logical characterizations of deterministic linear time classes -- Finding the k shortest paths in parallel -- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs -- Distance approximating spanning trees -- A better upper bound on the bisection width of de Bruijn networks -- An information-theoretic treatment of random-self-reducibility -- Equivalence of measures of complexity classes -- Better algorithms for minimum weight vertex-connectivity problems -- RNC-approximation algorithms for the steiner problem -- Pattern matching in trace monoids -- Removing ?-transitions in timed automata -- Probabilistic proof systems — A survey. |
| Record Nr. | UNINA-9910144926503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 97 [[electronic resource] ] : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings / / edited by Rüdiger Reischuk, Michel Morvan
| STACS 97 [[electronic resource] ] : 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997 Proceedings / / edited by Rüdiger Reischuk, Michel Morvan |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XV, 621 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Programming languages (Electronic computers) Computer science—Mathematics Theory of Computation Programming Techniques Programming Languages, Compilers, Interpreters Discrete Mathematics in Computer Science |
| ISBN | 3-540-68342-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Unifying models -- Predecessor queries in dynamic integer sets -- Semi-dynamic shortest paths and breadth-first search in digraphs -- Greibach normal form transformation, revisited -- Translating regular expressions into small ?-free nondeterministic finite automata -- Memory management for Union-Find algorithms -- Fast online multiplication of real numbers -- The operators min and max on the polynomial hierarchy -- Resource-bounded kolmogorov complexity revisited -- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations -- Interactive proof systems with public coin: Lower space bounds and hierarchies of complexity classes -- MODp-tests, almost independence and small probability spaces -- Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification -- Temporal logics for the specification of performance and reliability -- Efficient scaling-invariant checking of timed bisimulation -- Gossiping and broadcasting versus computing functions in networks -- On the descriptive and algorithmic power of parity ordered binary decision diagrams -- A reducibility concept for problems defined in terms of ordered binary decision diagrams -- On the classification of computable languages -- A conditional-logical approach to minimum cross-entropy -- Undecidability results on two-variable logics -- Methods and applications of (max,+) linear algebra -- Regular expressions and context-free grammars for picture languages -- Measuring nondeterminism in pushdown automata -- On polynomially D verbose sets -- A downward translation in the polynomial hierarchy -- Strict sequential P-completeness -- An unambiguous class possessing a complete set -- Deadlock-free interval routing schemes -- Power consumption in packet radio networks -- The complexity of generating test instances -- Efficient constructions of Hitting Sets for systems of linear functions -- Protocols for collusion-secure asymmetric fingerprinting -- Minimal transition systems for history-preserving bisimulation -- On ergodic linear cellular automata over Zm -- Intrinsic universality of a 1-dimensional reversible Cellular Automaton -- The computational complexity of some problems of linear algebra -- Algebraic and logical characterizations of deterministic linear time classes -- Finding the k shortest paths in parallel -- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs -- Distance approximating spanning trees -- A better upper bound on the bisection width of de Bruijn networks -- An information-theoretic treatment of random-self-reducibility -- Equivalence of measures of complexity classes -- Better algorithms for minimum weight vertex-connectivity problems -- RNC-approximation algorithms for the steiner problem -- Pattern matching in trace monoids -- Removing ?-transitions in timed automata -- Probabilistic proof systems — A survey. |
| Record Nr. | UNISA-996465983703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||