Info
Parallel Algorithms for Irregularly Structured Problems [[electronic resource] ] : Second International Workshop, IRREGULAR '95, Lyon, France, September 4 - 6, 1995. Proceedings / / edited by Afonso Ferreira, Jose Rolim
| Parallel Algorithms for Irregularly Structured Problems [[electronic resource] ] : Second International Workshop, IRREGULAR '95, Lyon, France, September 4 - 6, 1995. Proceedings / / edited by Afonso Ferreira, Jose Rolim |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (X, 418 p.) |
| Disciplina | 005.2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Architecture, Computer Computer programming Microprocessors Arithmetic and logic units, Computer Theory of Computation Computer System Implementation Computation by Abstract Devices Programming Techniques Processor Architectures Arithmetic and Logic Structures |
| ISBN | 3-540-44915-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Regular versus irregular problems and algorithms -- Algorithmic skeletons for adaptive multigrid methods -- Run-time techniques for parallelizing sparse matrix problems -- Fast execution of irregularly structured programs with low communication frequency on the hypercube -- Run-time parallelization of irregular DOACROSS loops -- Instruction scheduling and global register allocation for SIMD multiprocessors -- General bounds for the assignment of irregular dependency graphs -- A new scheme for dynamic processor assignment for irregular problems -- An efficient mean field annealing formulation for mapping unstructured domains to hypercubes -- Partitioning & mapping of unstructured meshes to parallel machine topologies -- Integrating software pipelining and graph scheduling for iterative scientific computations -- Approximation algorithms for time constrained scheduling -- On the scope of applicability of the ETF algorithm -- Optimal mapping of neighbourhood-constrained systems -- Parallel processing in DNA analysis -- Solving computational fluid dynamics problems on unstructured grids with distributed parallel processing -- Parallel decomposition of unstructured FEM-meshes -- Massively parallel approximation of irregular triangular meshes with G1 parametric surfaces -- Distributed symbolic computation with DTS -- A parallel processing paradigm for irregular applications -- Load balancing strategies for a parallel system of particles -- A reconfigurable parallel algorithm for sparse Cholesky factorization -- Adapted wavelet analysis on moderate parallel distributed memory MIMD architectures -- A new parallel approach to the constrained two-dimensional cutting stock problem -- Using the ProSet-Linda prototyping language for investigating MIMD algorithms for model matching in 3-D computer vision -- Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP -- Better algorithms for parallel backtracking -- Parallel game tree search on SIMD machines -- Asynchronous parallel branch and bound and anomalies -- Fast priority queues for parallel branch-and-bound -- A parallel formulation for general branch-and-bound algorithms. |
| Record Nr. | UNISA-996466162803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parallel and Distributed Computing: Theory and Practice [[electronic resource] ] : Theory and Practice. First Canada-France Conference, Montreal, Canada, May 19 - 21, 1994. Proceedings / / edited by Michel Cosnard, Afonso Ferreira, Joseph Peters
| Parallel and Distributed Computing: Theory and Practice [[electronic resource] ] : Theory and Practice. First Canada-France Conference, Montreal, Canada, May 19 - 21, 1994. Proceedings / / edited by Michel Cosnard, Afonso Ferreira, Joseph Peters |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XI, 285 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Computers Operating systems (Computers) Computer communication systems Numerical analysis Computer System Implementation Theory of Computation Operating Systems Computer Communication Networks Computation by Abstract Devices Numerical Analysis |
| ISBN | 3-540-48435-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Juggling networks -- Optimal parallel verification of minimum spanning trees in logarithmic time -- The parallel complexity of algorithms for pattern formation models -- On the parallel complexity of iterated multiplication in rings of algebraic integers -- NC 2 Algorithms regarding Hamiltonian paths and circuits in interval graphs -- Concurrency in an O (log log N) priority queue -- Embedding k-D meshes into optimum hypercubes with dilation 2k-1 extended abstract -- Embedding 3-dimensional grids into optimal hypercubes -- Distributed cyclic reference counting -- Efficient reconstruction of the causal relationship in distributed systems -- Scalable parallel computational geometry -- Sorting and selection on arrays with diagonal connections -- Work-Optimal thinning algorithm on SIMD machines -- An efficient implementation of parallel A* -- Constant-time convexity problems on reconfigurable meshes -- Deepness analysis: Bringing optimal fronts to triangular finite element method -- Communications in bus networks -- Fault-tolerant linear broadcasting -- The minimum broadcast time problem -- The complexity of systolic dissemination of information in interconnection networks -- Representations of gossip schemes -- On the multiply-twisted hypercube. |
| Record Nr. | UNISA-996466248803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 5th International Symposium, IRREGULAR'98, Berkeley, California, USA, August 9-11, 1998. Proceedings / / edited by Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng
| Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 5th International Symposium, IRREGULAR'98, Berkeley, California, USA, August 9-11, 1998. Proceedings / / edited by Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (X, 414 p.) |
| Disciplina | 005.2/75 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computers Architecture, Computer Computer programming Computer science—Mathematics Computer mathematics Algorithm Analysis and Problem Complexity Theory of Computation Computer System Implementation Programming Techniques Discrete Mathematics in Computer Science Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-68533-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial preconditioning for sparse linear systems -- A threaded sliding window executor for irregular computation on a NOW -- Parallel profile matching for large scale webcasting -- Large-scale SVD and subspace-based methods for information retrieval -- Thick-restart Lanczos method for symmetric eigenvalue problems -- Portable parallel adaptation of unstructured 3D meshes -- Partitioning sparse rectangular matrices for parallel processing -- Locality preserving load balancing with provably small overhead -- Tree-based parallel load-balancing methods for solution-adaptive unstructured finite element models on distributed memory multicomputers -- Coarse-grid selection for parallel algebraic multigrid -- Overlapping and short-cutting techniques in loosely synchronous irregular problems -- Control volume meshes using sphere packing -- Using multithreading for the automatic load balancing of adaptive finite element meshes -- Dynamic load balancing for parallel adaptive mesh refinement -- A robust and scalable library for parallel adaptive mesh refinement on unstructured meshes -- Quality balancing for parallel adaptive FEM -- Parallelization of an unstructured grid, hydrodynamic-diffusion code -- Exchange of messages of different sizes -- The distributed object-oriented threads system DOTS -- Graph partitioning and parallel solvers: Has the emperor no clothes? -- Parallel simulation of particulate flows -- Parallel vertex-to-vertex radiosity on a distributed shared memory system -- Load balancing in parallel molecular dynamics -- COMPASSION: A parallel I/O runtime system including chunking and compression for irregular applications -- Transformations of Cauchy matrices, Trummer's problem and a Cauchy-like linear solver -- A parallel GRASP for the Steiner problem in graphs -- A new simple parallel tree contraction scheme and its application on distance-hereditary graphs -- Cooperative multi-thread parallel tabu search with an application to circuit partitioning -- Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via Irregularization -- Balancing the load in large-scale distributed entity-level simulations -- Modeling dynamic load balancing in molecular dynamics to achieve scalable parallel execution -- Relaxed Implementation of spectral methods for graph partitioning -- S-HARP: A parallel dynamic spectral partitioner -- Information filtering using the Riemannian SVD (R-SVD) -- Parallel run-time system for adaptive mesh refinement. |
| Record Nr. | UNISA-996466358703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 5th International Symposium, IRREGULAR'98, Berkeley, California, USA, August 9-11, 1998. Proceedings / / edited by Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng
| Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 5th International Symposium, IRREGULAR'98, Berkeley, California, USA, August 9-11, 1998. Proceedings / / edited by Afonso Ferreira, Jose Rolim, Horst Simon, Shang-Hua Teng |
| Edizione | [1st ed. 1998.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 |
| Descrizione fisica | 1 online resource (X, 414 p.) |
| Disciplina | 005.2/75 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Algorithms
Computers Computer architecture Computer programming Computer science—Mathematics Computer science - Mathematics Algorithm Analysis and Problem Complexity Theory of Computation Computer System Implementation Programming Techniques Discrete Mathematics in Computer Science Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-68533-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Combinatorial preconditioning for sparse linear systems -- A threaded sliding window executor for irregular computation on a NOW -- Parallel profile matching for large scale webcasting -- Large-scale SVD and subspace-based methods for information retrieval -- Thick-restart Lanczos method for symmetric eigenvalue problems -- Portable parallel adaptation of unstructured 3D meshes -- Partitioning sparse rectangular matrices for parallel processing -- Locality preserving load balancing with provably small overhead -- Tree-based parallel load-balancing methods for solution-adaptive unstructured finite element models on distributed memory multicomputers -- Coarse-grid selection for parallel algebraic multigrid -- Overlapping and short-cutting techniques in loosely synchronous irregular problems -- Control volume meshes using sphere packing -- Using multithreading for the automatic load balancing of adaptive finite element meshes -- Dynamic load balancing for parallel adaptive mesh refinement -- A robust and scalable library for parallel adaptive mesh refinement on unstructured meshes -- Quality balancing for parallel adaptive FEM -- Parallelization of an unstructured grid, hydrodynamic-diffusion code -- Exchange of messages of different sizes -- The distributed object-oriented threads system DOTS -- Graph partitioning and parallel solvers: Has the emperor no clothes? -- Parallel simulation of particulate flows -- Parallel vertex-to-vertex radiosity on a distributed shared memory system -- Load balancing in parallel molecular dynamics -- COMPASSION: A parallel I/O runtime system including chunking and compression for irregular applications -- Transformations of Cauchy matrices, Trummer's problem and a Cauchy-like linear solver -- A parallel GRASP for the Steiner problem in graphs -- A new simple parallel tree contraction scheme and its application on distance-hereditary graphs -- Cooperative multi-thread parallel tabu search with an application to circuit partitioning -- Experiments with mpC: Efficient solving regular problems on heterogeneous networks of computers via Irregularization -- Balancing the load in large-scale distributed entity-level simulations -- Modeling dynamic load balancing in molecular dynamics to achieve scalable parallel execution -- Relaxed Implementation of spectral methods for graph partitioning -- S-HARP: A parallel dynamic spectral partitioner -- Information filtering using the Riemannian SVD (R-SVD) -- Parallel run-time system for adaptive mesh refinement. |
| Record Nr. | UNINA-9910768463003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1998 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings / / edited by Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, Jose Rolim
| Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings / / edited by Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, Jose Rolim |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 287 p.) |
| Disciplina | 005.2/75 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Algorithms Computer programming Operating systems (Computers) Numerical analysis Computer mathematics Computer System Implementation Algorithm Analysis and Problem Complexity Programming Techniques Operating Systems Numeric Computing Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-69157-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Parallel mesh generation -- Efficient massively parallel quicksort -- Practical parallel list ranking -- On computing all maximal cliques distributedly -- A probabilistic model for best-first search B&B algorithms -- Programming irregular parallel applications in Cilk -- A variant of the biconjugate gradient method suitable for massively parallel computing -- Efficient implementation of the improved quasi-minimal residual method on massively distributed memory computers -- Programming with shared data abstractions -- EXPLORER: Supporting run-time parallelization of DO-ACROSS loops on general networks of workstations -- Engineering diffusive load balancing algorithms using experiments -- Comparative study of static scheduling with task duplication for distributed systems -- A new approximation algorithm for the register allocation problem -- A parallel approximation algorithm for resource constrained scheduling and bin packing -- Virtual Data Space-A Universal load balancing scheme -- Improving cache performance through tiling and data alignment -- A support for non-uniform parallel loops and its application to a flame simulation code -- Performance optimization of combined variable-cost computations and I/O -- Parallel shared-memory state-space exploration in stochastic modeling -- Parallel software caches -- Communication efficient parallel searching -- Parallel sparse Cholesky factorization -- Unstructured graph partitioning for sparse linear system solving. |
| Record Nr. | UNISA-996465404803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings / / edited by Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, Jose Rolim
| Solving Irregularly Structured Problems in Parallel [[electronic resource] ] : 4th International Symposium, IRREGULAR '97, Paderborn, Germany, June 12-13, 1997, Proceedings / / edited by Gianfranco Bilardi, Afonso Ferreira, Reinhard Lüling, Jose Rolim |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (X, 287 p.) |
| Disciplina | 005.2/75 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer architecture
Algorithms Computer programming Operating systems (Computers) Numerical analysis Computer science - Mathematics Computer System Implementation Algorithm Analysis and Problem Complexity Programming Techniques Operating Systems Numeric Computing Computational Mathematics and Numerical Analysis |
| ISBN | 3-540-69157-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Parallel mesh generation -- Efficient massively parallel quicksort -- Practical parallel list ranking -- On computing all maximal cliques distributedly -- A probabilistic model for best-first search B&B algorithms -- Programming irregular parallel applications in Cilk -- A variant of the biconjugate gradient method suitable for massively parallel computing -- Efficient implementation of the improved quasi-minimal residual method on massively distributed memory computers -- Programming with shared data abstractions -- EXPLORER: Supporting run-time parallelization of DO-ACROSS loops on general networks of workstations -- Engineering diffusive load balancing algorithms using experiments -- Comparative study of static scheduling with task duplication for distributed systems -- A new approximation algorithm for the register allocation problem -- A parallel approximation algorithm for resource constrained scheduling and bin packing -- Virtual Data Space-A Universal load balancing scheme -- Improving cache performance through tiling and data alignment -- A support for non-uniform parallel loops and its application to a flame simulation code -- Performance optimization of combined variable-cost computations and I/O -- Parallel shared-memory state-space exploration in stochastic modeling -- Parallel software caches -- Communication efficient parallel searching -- Parallel sparse Cholesky factorization -- Unstructured graph partitioning for sparse linear system solving. |
| Record Nr. | UNINA-9910767547703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2001 [[electronic resource] ] : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings / / edited by Afonso Ferreira, Horst Reichel
| STACS 2001 [[electronic resource] ] : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings / / edited by Afonso Ferreira, Horst Reichel |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XVI, 580 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Optical data processing Computer science—Mathematics Theory of Computation Data Structures and Information Theory Image Processing and Computer Vision Data Structures Mathematics of Computing |
| ISBN | 3-540-44693-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Recurrence in Infinite Words -- Generalized Model-Checking Problems for First-Order Logic -- Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra -- Contributions -- 2-Nested Simulation Is Not Finitely Equationally Axiomatizable -- On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems -- Matching Polygonal Curves with Respect to the Fréchet Distance -- On the Class of Languages Recognizable by 1-Way Quantum Finite Automata -- Star-Free Open Languages and Aperiodic Loops -- A 5/2n 2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication -- Evasiveness of Subgraph Containment and Related Properties -- On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs -- On Presburger Liveness of Discrete Timed Automata -- Residual Finite State Automata -- Deterministic Radio Broadcasting at Low Cost -- The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE—Complete -- Recursive Randomized Coloring Beats Fair Dice Random Colorings -- Randomness, Computability, and Density -- On Multipartition Communication Complexity -- Scalable Sparse Topologies with Small Spectrum -- Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios -- The UPS Problem -- Gathering of Asynchronous Oblivious Robots with Limited Visibility -- Generalized Langton’s Ant: Dynamical Behavior and Complexity -- Optimal and Approximate Station Placement in Networks -- Learning Expressions over Monoids -- Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods -- On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages -- Efficient Minimal Perfect Hashing in Nearly Minimal Space -- Small PCPs with Low Query Complexity -- Space Efficient Algorithms for Series-Parallel Graphs -- A Toolkit for First Order Extensions of Monadic Games -- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs -- Refining the Hierarchy of Blind Multicounter Languages -- A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c -- New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata -- The Complexity of Minimal Satisfiability Problems -- On the Minimal Hardware Complexity of Pseudorandom Function Generators -- Approximation Algorithms for Minimum Size 2-Connectivity Problems -- A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets -- An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases -- A New Logical Characterization of Büchi Automata -- A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph -- The Complexity of Copy Constant Detection in Parallel Programs -- Approximation Algorithms for the Bottleneck Stretch Factor Problem -- Semantical Principles in the Modal Logic of Coalgebras -- The #a = #b Pictures Are Recognizable -- A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages -- Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables -- New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. |
| Record Nr. | UNISA-996465683603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2001 : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings / / edited by Afonso Ferreira, Horst Reichel
| STACS 2001 : 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001. Proceedings / / edited by Afonso Ferreira, Horst Reichel |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XVI, 580 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Optical data processing Computer science—Mathematics Theory of Computation Data Structures and Information Theory Image Processing and Computer Vision Data Structures Mathematics of Computing |
| ISBN | 3-540-44693-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Presentations -- Recurrence in Infinite Words -- Generalized Model-Checking Problems for First-Order Logic -- Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra -- Contributions -- 2-Nested Simulation Is Not Finitely Equationally Axiomatizable -- On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems -- Matching Polygonal Curves with Respect to the Fréchet Distance -- On the Class of Languages Recognizable by 1-Way Quantum Finite Automata -- Star-Free Open Languages and Aperiodic Loops -- A 5/2n 2-Lower Bound for the Multiplicative Complexity of n × n-Matrix Multiplication -- Evasiveness of Subgraph Containment and Related Properties -- On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs -- On Presburger Liveness of Discrete Timed Automata -- Residual Finite State Automata -- Deterministic Radio Broadcasting at Low Cost -- The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE—Complete -- Recursive Randomized Coloring Beats Fair Dice Random Colorings -- Randomness, Computability, and Density -- On Multipartition Communication Complexity -- Scalable Sparse Topologies with Small Spectrum -- Optimal Preemptive Scheduling on Uniform Processors with Non-decreasing Speed Ratios -- The UPS Problem -- Gathering of Asynchronous Oblivious Robots with Limited Visibility -- Generalized Langton’s Ant: Dynamical Behavior and Complexity -- Optimal and Approximate Station Placement in Networks -- Learning Expressions over Monoids -- Efficient Recognition of Random Unsatisfiable k-SAT Instances by Spectral Methods -- On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages -- Efficient Minimal Perfect Hashing in Nearly Minimal Space -- Small PCPs with Low Query Complexity -- Space Efficient Algorithms for Series-Parallel Graphs -- A Toolkit for First Order Extensions of Monadic Games -- Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs -- Refining the Hierarchy of Blind Multicounter Languages -- A Simple Undecidable Problem: The Inclusion Problem for Finite Substitutions on ab*c -- New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata -- The Complexity of Minimal Satisfiability Problems -- On the Minimal Hardware Complexity of Pseudorandom Function Generators -- Approximation Algorithms for Minimum Size 2-Connectivity Problems -- A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets -- An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases -- A New Logical Characterization of Büchi Automata -- A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph -- The Complexity of Copy Constant Detection in Parallel Programs -- Approximation Algorithms for the Bottleneck Stretch Factor Problem -- Semantical Principles in the Modal Logic of Coalgebras -- The #a = #b Pictures Are Recognizable -- A Logical Approach to Decidability of Hierarchies of Regular Star—Free Languages -- Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables -- New Bounds on the OBDD-Size of Integer Multiplication via Universal Hashing. |
| Record Nr. | UNINA-9910143604903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
STACS 2002 [[electronic resource] ] : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings / / edited by Helmut Alt, Afonso Ferreira
| STACS 2002 [[electronic resource] ] : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings / / edited by Helmut Alt, Afonso Ferreira |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XIV, 660 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Application software Computer graphics Computer science—Mathematics Theory of Computation Data Structures and Information Theory Computer Applications Data Structures Computer Graphics Discrete Mathematics in Computer Science |
| ISBN | 3-540-45841-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Hyper-Encryption and Everlasting Security -- Models and Techniques for Communication in Dynamic Networks -- What Is a Theory? -- Algorithms -- A Space Lower Bound for Routing in Trees -- Labeling Schemes for Dynamic Tree Networks -- Tight Bounds for the Performance of Longest-in-System on DAGs -- Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling -- Balanced Coloring: Equally Easy for All Numbers of Colors? -- The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 -- On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets -- On Dualization in Products of Forests -- An Asymptotic (ln ?/ ln ln ?)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs -- Scheduling at Twilight the EasyWay -- Complexity of Multi-dimensional Loop Alignment -- A Probabilistic 3—SAT Algorithm Further Improved -- The Secret of Selective Game Tree Search, When Using Random-Error Evaluations -- Randomized Acceleration of Fundamental Matrix Computations -- Approximations for ATSP with Parametrized Triangle Inequality -- A New Diagram from Disks in the Plane -- Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles -- Current Challenges -- On the Parameterized Intractability of Closest Substring and Related Problems -- On the Complexity of Protein Similarity Search under mRNA Structure Constraints -- Pure Dominance Constraints -- Improved Quantum Communication Complexity Bounds for Disjointness and Equality -- On Quantum Computation with Some Restricted Amplitudes -- A Quantum Goldreich-Levin Theorem with Cryptographic Applications -- On Quantum and Approximate Privacy -- On Quantum Versions of the Yao Principle -- Computational and Structural Complexity -- Describing Parameterized Complexity Classes -- On the Computational Power of Boolean Decision Lists -- How Many Missing Answers Can Be Tolerated by Query Learners? -- Games with a Uniqueness Property -- Bi-Immunity Separates Strong NP-Completeness Notions -- Complexity of Semi-algebraic Proofs -- A Lower Bound Technique for Restricted Branching Programs and Applications -- The Complexity of Constraints on Intervals and Lengths -- Automata and Formal Languages -- Nesting Until and Since in Linear Temporal Logic -- Comparing Verboseness for Finite Automata and Turing Machines -- On the Average Parallelism in Trace Monoids -- A Further Step towards a Theory of Regular MSC Languages -- Existential and Positive Theories of Equations in Graph Products -- The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL -- Recognizable Sets of Message Sequence Charts -- Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard -- On the Enumerative Sequences of Regular Languages on k Symbols -- Logic in Computer Science -- Ground Tree Rewriting Graphs of Bounded Tree Width -- Timed Control Synthesis for External Specifications -- Axiomatizing GSOS with Termination -- Axiomatising Tree-Interpretable Structures -- EXPSPACE-Complete Variant of Guarded Fragment with Transitivity -- A Parametric Analysis of the State Explosion Problem in Model Checking -- Generalized Model-Checking over Locally Tree-Decomposable Classes -- Learnability and Definability in Trees and Similar Structures. |
| Record Nr. | UNISA-996465381103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings / / edited by Helmut Alt, Afonso Ferreira
| STACS 2002 : 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings / / edited by Helmut Alt, Afonso Ferreira |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XIV, 660 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Data structures (Computer science) Application software Computer graphics Computer science—Mathematics Theory of Computation Data Structures and Information Theory Computer Applications Data Structures Computer Graphics Discrete Mathematics in Computer Science |
| ISBN | 3-540-45841-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Hyper-Encryption and Everlasting Security -- Models and Techniques for Communication in Dynamic Networks -- What Is a Theory? -- Algorithms -- A Space Lower Bound for Routing in Trees -- Labeling Schemes for Dynamic Tree Networks -- Tight Bounds for the Performance of Longest-in-System on DAGs -- Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling -- Balanced Coloring: Equally Easy for All Numbers of Colors? -- The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3 -- On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets -- On Dualization in Products of Forests -- An Asymptotic (ln ?/ ln ln ?)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs -- Scheduling at Twilight the EasyWay -- Complexity of Multi-dimensional Loop Alignment -- A Probabilistic 3—SAT Algorithm Further Improved -- The Secret of Selective Game Tree Search, When Using Random-Error Evaluations -- Randomized Acceleration of Fundamental Matrix Computations -- Approximations for ATSP with Parametrized Triangle Inequality -- A New Diagram from Disks in the Plane -- Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles -- Current Challenges -- On the Parameterized Intractability of Closest Substring and Related Problems -- On the Complexity of Protein Similarity Search under mRNA Structure Constraints -- Pure Dominance Constraints -- Improved Quantum Communication Complexity Bounds for Disjointness and Equality -- On Quantum Computation with Some Restricted Amplitudes -- A Quantum Goldreich-Levin Theorem with Cryptographic Applications -- On Quantum and Approximate Privacy -- On Quantum Versions of the Yao Principle -- Computational and Structural Complexity -- Describing Parameterized Complexity Classes -- On the Computational Power of Boolean Decision Lists -- How Many Missing Answers Can Be Tolerated by Query Learners? -- Games with a Uniqueness Property -- Bi-Immunity Separates Strong NP-Completeness Notions -- Complexity of Semi-algebraic Proofs -- A Lower Bound Technique for Restricted Branching Programs and Applications -- The Complexity of Constraints on Intervals and Lengths -- Automata and Formal Languages -- Nesting Until and Since in Linear Temporal Logic -- Comparing Verboseness for Finite Automata and Turing Machines -- On the Average Parallelism in Trace Monoids -- A Further Step towards a Theory of Regular MSC Languages -- Existential and Positive Theories of Equations in Graph Products -- The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL -- Recognizable Sets of Message Sequence Charts -- Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard -- On the Enumerative Sequences of Regular Languages on k Symbols -- Logic in Computer Science -- Ground Tree Rewriting Graphs of Bounded Tree Width -- Timed Control Synthesis for External Specifications -- Axiomatizing GSOS with Termination -- Axiomatising Tree-Interpretable Structures -- EXPSPACE-Complete Variant of Guarded Fragment with Transitivity -- A Parametric Analysis of the State Explosion Problem in Model Checking -- Generalized Model-Checking over Locally Tree-Decomposable Classes -- Learnability and Definability in Trees and Similar Structures. |
| Record Nr. | UNINA-9910143913903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||