LATIN 2000: Theoretical Informatics [[electronic resource] ] : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings / / edited by Gaston H. Gonnet, Daniel Panario, Alfredo Viola |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (XII, 484 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer communication systems Combinatorics Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computer Communication Networks |
ISBN | 3-540-46415-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Random Structures and Algorithms -- Algorithmic Aspects of Regularity -- Small Maximal Matchings in Random Graphs -- Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs -- Analysis of Edge Deletion Processes on Faulty Random Regular Graphs -- Equivalent Conditions for Regularity (Extended Abstract) -- Algorithms I -- Cube Packing -- Approximation Algorithms for Flexible Job Shop Problems -- Emerging Behavior as Binary Search Trees Are Symmetrically Updated -- The LCA Problem Revisited -- Combinatorial Designs -- Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays -- Rank Inequalities for Packing Designs and Sparse Triple Systems -- The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs -- Web Graph, Graph Theory I -- Graph Structure of the Web: A Survey -- Polynomial Time Recognition of Clique-Width ? 3 Graphs -- On Dart-Free Perfectly Contractile Graphs Extended Abstract -- Graph Theory II -- Edge Colouring Reduced Indifference Graphs -- Two Conjectures on the Chromatic Polynomial -- Finding Skew Partitions Efficiently -- Competitive Analysis, Complexity -- On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract) -- Almost k-Wise Independence and Hard Boolean Functions -- Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function -- Algorithms II -- Multi-parameter Minimum Spanning Trees -- Linear Time Recognition of Optimal L-Restricted Prefix Codes -- Uniform Multi-hop All-to-All Optical Routings in Rings -- A Fully Dynamic Algorithm for Distributed Shortest Paths -- Computational Number Theory, Cryptography -- Integer Factorization and Discrete Logarithms -- Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key -- Quintic Reciprocity and Primality Test for Numbers of the Form -- Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography -- Analysis of Algorithms I -- Average-Case Analysis of Rectangle Packings -- Heights in Generalized Tries and PATRICIA Tries -- On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract -- Algebraic Algorithms -- Subresultants Revisited -- A Unifying Framework for the Analysis of a Class of Euclidean Algorithms -- Worst-Case Complexity of the Optimal LLL Algorithm -- Computability -- Iteration Algebras Are Not Finitely Axiomatizable -- Undecidable Problems in Unreliable Computations -- Automata, Formal Languages -- Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups -- Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers -- Unambiguous Büchi Automata -- Linear Time Language Recognition on Cellular Automata with Restricted Communication -- Logic, Programming Theory -- From Semantics to Spatial Distribution -- On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics -- A Theory of Operational Equivalence for Interaction Nets -- Analysis of Algorithms II -- Run Statistics for Geometrically Distributed Random Variables -- Generalized Covariances of Multi-dimensional Brownian Excursion Local Times -- Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs. |
Record Nr. | UNISA-996465797503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
LATIN 2000: Theoretical Informatics : 4th Latin American Symposium, Punta del Este, Uruguay, April 10-14, 2000 Proceedings / / edited by Gaston H. Gonnet, Daniel Panario, Alfredo Viola |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (XII, 484 p.) |
Disciplina | 004 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computers
Algorithms Computer science—Mathematics Computer communication systems Combinatorics Theory of Computation Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Computer Communication Networks |
ISBN | 3-540-46415-8 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Random Structures and Algorithms -- Algorithmic Aspects of Regularity -- Small Maximal Matchings in Random Graphs -- Some Remarks on Sparsely Connected Isomorphism-Free Labeled Graphs -- Analysis of Edge Deletion Processes on Faulty Random Regular Graphs -- Equivalent Conditions for Regularity (Extended Abstract) -- Algorithms I -- Cube Packing -- Approximation Algorithms for Flexible Job Shop Problems -- Emerging Behavior as Binary Search Trees Are Symmetrically Updated -- The LCA Problem Revisited -- Combinatorial Designs -- Optimal and Pessimal Orderings of Steiner Triple Systems in Disk Arrays -- Rank Inequalities for Packing Designs and Sparse Triple Systems -- The Anti-Oberwolfach Solution: Pancyclic 2-Factorizations of Complete Graphs -- Web Graph, Graph Theory I -- Graph Structure of the Web: A Survey -- Polynomial Time Recognition of Clique-Width ? 3 Graphs -- On Dart-Free Perfectly Contractile Graphs Extended Abstract -- Graph Theory II -- Edge Colouring Reduced Indifference Graphs -- Two Conjectures on the Chromatic Polynomial -- Finding Skew Partitions Efficiently -- Competitive Analysis, Complexity -- On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract) -- Almost k-Wise Independence and Hard Boolean Functions -- Improved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function -- Algorithms II -- Multi-parameter Minimum Spanning Trees -- Linear Time Recognition of Optimal L-Restricted Prefix Codes -- Uniform Multi-hop All-to-All Optical Routings in Rings -- A Fully Dynamic Algorithm for Distributed Shortest Paths -- Computational Number Theory, Cryptography -- Integer Factorization and Discrete Logarithms -- Communication Complexity and Fourier Coefficients of the Diffie–Hellman Key -- Quintic Reciprocity and Primality Test for Numbers of the Form -- Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography -- Analysis of Algorithms I -- Average-Case Analysis of Rectangle Packings -- Heights in Generalized Tries and PATRICIA Tries -- On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract -- Algebraic Algorithms -- Subresultants Revisited -- A Unifying Framework for the Analysis of a Class of Euclidean Algorithms -- Worst-Case Complexity of the Optimal LLL Algorithm -- Computability -- Iteration Algebras Are Not Finitely Axiomatizable -- Undecidable Problems in Unreliable Computations -- Automata, Formal Languages -- Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups -- Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers -- Unambiguous Büchi Automata -- Linear Time Language Recognition on Cellular Automata with Restricted Communication -- Logic, Programming Theory -- From Semantics to Spatial Distribution -- On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics -- A Theory of Operational Equivalence for Interaction Nets -- Analysis of Algorithms II -- Run Statistics for Geometrically Distributed Random Variables -- Generalized Covariances of Multi-dimensional Brownian Excursion Local Times -- Combinatorics of Geometrically Distributed Random Variables: Length of Ascending Runs. |
Record Nr. | UNINA-9910144130003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
LATIN 2014: Theoretical Informatics [[electronic resource] ] : 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings / / edited by Alberto Pardo, Alfredo Viola |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XXX, 767 p. 137 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Artificial intelligence—Data processing Discrete Mathematics in Computer Science Theory of Computation Data Science |
Soggetto genere / forma |
Kongress2014.Montevideo
Conference papers and proceedings. |
ISBN | 3-642-54423-1 |
Classificazione |
SS 4800
DAT 500f |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Complexity -- Computational geometry -- Graph drawing -- Automata -- Computability -- Algorithms on graphs -- Algorithms -- Random structures -- Complexity on graphs -- Analytic combinatorics -- Analytic and enumerative combinatorics -- Approximation algorithms -- Analysis of algorithms -- Computational algebra -- Applications to bioinformatics -- Budget problems.- Algorithms and data structures. |
Record Nr. | UNISA-996203273303316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|
LATIN 2014: Theoretical Informatics : 11th Latin American Symposium, Montevideo, Uruguay, March 31 -- April 4, 2014. Proceedings / / edited by Alberto Pardo, Alfredo Viola |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XXX, 767 p. 137 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Computer science Artificial intelligence—Data processing Discrete Mathematics in Computer Science Theory of Computation Data Science |
Soggetto genere / forma |
Kongress2014.Montevideo
Conference papers and proceedings. |
ISBN | 3-642-54423-1 |
Classificazione |
SS 4800
DAT 500f |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Complexity -- Computational geometry -- Graph drawing -- Automata -- Computability -- Algorithms on graphs -- Algorithms -- Random structures -- Complexity on graphs -- Analytic combinatorics -- Analytic and enumerative combinatorics -- Approximation algorithms -- Analysis of algorithms -- Computational algebra -- Applications to bioinformatics -- Budget problems.- Algorithms and data structures. |
Record Nr. | UNINA-9910483744203321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Space-Efficient Data Structures, Streams, and Algorithms : Papers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday / / edited by Andrej Brodnik, Alejandro Lopez-Ortiz, Venkatesh Raman, Alfredo Viola |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XXVIII, 363 p. 58 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer networks Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Computer Communication Networks |
ISBN | 3-642-40273-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The Query Complexity of Finding a Hidden Permutation -- Bounds for Scheduling Jobs on Grid Processors -- Quake Heaps: A Simple Alternative to Fibonacci Heaps -- Variations on Instant Insanity -- A Simple Linear-Space Data Structure for Constant-Time Range -- Closing a Long-Standing Complexity Gap for Selection: V3(42) = 50 -- Frugal Streaming for Estimating Quantiles -- From Time to Space: Fast Algorithms That Yield Small and Fast Data -- Computing (and life) Is all About Tradeoffs: A Small Sample of Some Computational Tradeoffs -- A History of Distribution-Sensitive Data Structures -- A Survey on Priority Queues -- On Generalized Comparison-Based Sorting Problems -- A Survey of the Game “Lights Out!” -- Random Access to High-Order Entropy Compressed Text -- Succinct and Implicit Data Structures for Computational Geometry -- In Pursuit of the Dynamic Optimality Conjecture -- A Survey of Algorithms and Models for List Update -- Orthogonal Range Searching for Text Indexing -- A Survey of Data Structures in the Bitprobe Model -- Succinct Representations of Ordinal Trees -- Array Range Queries -- Indexes for Document Retrieval with Relevance. |
Record Nr. | UNINA-9910484908003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. Federico II | ||
|
Space-Efficient Data Structures, Streams, and Algorithms : Papers in Honor of J. Ian Munro, on the Occasion of His 66th Birthday / / edited by Andrej Brodnik, Alejandro Lopez-Ortiz, Venkatesh Raman, Alfredo Viola |
Edizione | [1st ed. 2013.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
Descrizione fisica | 1 online resource (XXVIII, 363 p. 58 illus.) |
Disciplina | 005.1 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Algorithms
Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Computer graphics Numerical analysis Computer networks Data Science Discrete Mathematics in Computer Science Computer Graphics Numerical Analysis Computer Communication Networks |
ISBN | 3-642-40273-9 |
Formato | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | The Query Complexity of Finding a Hidden Permutation -- Bounds for Scheduling Jobs on Grid Processors -- Quake Heaps: A Simple Alternative to Fibonacci Heaps -- Variations on Instant Insanity -- A Simple Linear-Space Data Structure for Constant-Time Range -- Closing a Long-Standing Complexity Gap for Selection: V3(42) = 50 -- Frugal Streaming for Estimating Quantiles -- From Time to Space: Fast Algorithms That Yield Small and Fast Data -- Computing (and life) Is all About Tradeoffs: A Small Sample of Some Computational Tradeoffs -- A History of Distribution-Sensitive Data Structures -- A Survey on Priority Queues -- On Generalized Comparison-Based Sorting Problems -- A Survey of the Game “Lights Out!” -- Random Access to High-Order Entropy Compressed Text -- Succinct and Implicit Data Structures for Computational Geometry -- In Pursuit of the Dynamic Optimality Conjecture -- A Survey of Algorithms and Models for List Update -- Orthogonal Range Searching for Text Indexing -- A Survey of Data Structures in the Bitprobe Model -- Succinct Representations of Ordinal Trees -- Array Range Queries -- Indexes for Document Retrieval with Relevance. |
Record Nr. | UNISA-996465695203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
Materiale a stampa | ||
Lo trovi qui: Univ. di Salerno | ||
|