top

  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.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
1: Equations and initial semantics / H. Ehrig, B. Mahr
1: Equations and initial semantics / H. Ehrig, B. Mahr
Autore Ehrig, Hartmut
Pubbl/distr/stampa Berlin [etc.], : Springer, c1985
Descrizione fisica XI, 321 p. ; 25 cm.
Disciplina 005.7
005.73
Altri autori (Persone) Mahr, Bernd
Collana EATCS monographs on theoretical computer science
Soggetto topico Archivi di dati - Struttura
Algebra
ISBN 0387137181
3540137181
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISANNIO-AQ10002683
Ehrig, Hartmut  
Berlin [etc.], : Springer, c1985
Materiale a stampa
Lo trovi qui: Univ. del Sannio
Opac: Controlla la disponibilità qui
2: Module specification and constraints / H. Ehrig, B. Mahr
2: Module specification and constraints / H. Ehrig, B. Mahr
Autore Ehrig, Hartmut
Pubbl/distr/stampa Berlin [etc.], : Springer, c1990
Descrizione fisica XI, 427 p. ; 25 cm.
Disciplina 005.7
005.73
Altri autori (Persone) Mahr, Bernd
Collana EATCS monographs on theoretical computer science
Soggetto topico Archivi di dati - Struttura
Algebra
ISBN 0387517995
3540517995
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISANNIO-AQ10002685
Ehrig, Hartmut  
Berlin [etc.], : Springer, c1990
Materiale a stampa
Lo trovi qui: Univ. del Sannio
Opac: Controlla la disponibilità qui
A practical introduction to data structures and algorithm analysis / Clifford A.Shaffer
A practical introduction to data structures and algorithm analysis / Clifford A.Shaffer
Autore Shaffer, Clifford A.
Pubbl/distr/stampa Upper Saddle River (N.J.) : Prentice Hall, c1997
Descrizione fisica xvi, 494 p. : ill. ; 25 cm
Disciplina 005.73
Soggetto non controllato Computer science
Strutture dati
Algoritmi
ISBN 0-13-190752-2
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-990001439100403321
Shaffer, Clifford A.  
Upper Saddle River (N.J.) : Prentice Hall, c1997
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Abstract compositional analysis of iterated relations : a structural approach to complex state transition systems / / Frederic Geurts
Abstract compositional analysis of iterated relations : a structural approach to complex state transition systems / / Frederic Geurts
Autore Geurts Frederic <1965->
Edizione [1st ed. 1998.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer, , [1998]
Descrizione fisica 1 online resource (XII, 280 p. 78 illus.)
Disciplina 005.73
Collana Lecture Notes in Computer Science
Soggetto topico Abstract data types (Computer science)
System analysis
Electronic data processing - Structured techniques
Soggetto genere / forma Electronic books.
ISBN 3-540-49211-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Prologue: Aims, Themes, and Motivations -- Prologue: Aims, Themes, and Motivations -- Mathematical Framework: Iterated Relations and Composition -- Dynamics of Relations -- Dynamics of Composed Relations -- Abstract Complexity: Abstraction, Invariance, Attraction -- Abstract Observation of Dynamics -- Invariance, Attraction, Complexity -- Abstract Compositional Analysis of Systems: Dynamics and Computations -- Compositional Analysis of Dynamical Properties -- Case Studies: Compositional Analysis of Dynamics -- Experimental Compositional Analysis of Cellular Automata -- Compositional Analysis of Computational Properties -- Epilogue: Conclusions and Directions for Future Work.
Record Nr. UNISA-996466160603316
Geurts Frederic <1965->  
Berlin, Heidelberg : , : Springer, , [1998]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Abstract compositional analysis of iterated relations : a structural approach to complex state transition systems / / Frederic Geurts
Abstract compositional analysis of iterated relations : a structural approach to complex state transition systems / / Frederic Geurts
Autore Geurts Frederic <1965->
Edizione [1st ed. 1998.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer, , [1998]
Descrizione fisica 1 online resource (XII, 280 p. 78 illus.)
Disciplina 005.73
Collana Lecture Notes in Computer Science
Soggetto topico Abstract data types (Computer science)
System analysis
Electronic data processing - Structured techniques
Soggetto genere / forma Electronic books.
ISBN 3-540-49211-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Prologue: Aims, Themes, and Motivations -- Prologue: Aims, Themes, and Motivations -- Mathematical Framework: Iterated Relations and Composition -- Dynamics of Relations -- Dynamics of Composed Relations -- Abstract Complexity: Abstraction, Invariance, Attraction -- Abstract Observation of Dynamics -- Invariance, Attraction, Complexity -- Abstract Compositional Analysis of Systems: Dynamics and Computations -- Compositional Analysis of Dynamical Properties -- Case Studies: Compositional Analysis of Dynamics -- Experimental Compositional Analysis of Cellular Automata -- Compositional Analysis of Computational Properties -- Epilogue: Conclusions and Directions for Future Work.
Record Nr. UNINA-9910143504103321
Geurts Frederic <1965->  
Berlin, Heidelberg : , : Springer, , [1998]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Advanced information systems engineering : 14th International Conference, CAiSE 2002 Toronto, Canada, May 27-31, 2002, proceedings / / Anne Banks Pidduck [and three others] (editors)
Advanced information systems engineering : 14th International Conference, CAiSE 2002 Toronto, Canada, May 27-31, 2002, proceedings / / Anne Banks Pidduck [and three others] (editors)
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin ; ; Heidelberg ; ; New York : , : Springer, , [2002]
Descrizione fisica 1 online resource (XIV, 782 p.)
Disciplina 005.73
Collana Lecture Notes in Computer Science
Soggetto topico Data structures (Computer science)
Soggetto genere / forma Electronic books.
ISBN 3-540-47961-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Presentations -- The Grand Challenge in Information Technology and the Illusion of Validity -- Metadata and Cooperative Knowledge Management -- Ontology-Driven Conceptual Modeling -- Metadata and Cooperative Knowledge Management -- Web Component: A Substrate for Web Service Reuse and Composition -- Developing Web Applications -- Designing Web-Based Systems in Social Context: A Goal and Scenario Based Approach -- A State Machine Based Approach for a Process Driven Development of Web-Applications -- Knowledge Management -- Supporting Dimension Updates in an OLAP Server -- The COMET Metamodel for Temporal Data Warehouses -- Exploring RDF for Expertise Matching within an Organizational Memory -- Deployment Issues -- Describing and Communicating Software Architecture in Practice: Observations on Stakeholders and Rationale -- The Individual Deployment of Systems Development Methodologies -- Supporting the Deployment of Object-Oriented Frameworks -- Semantics of Information -- A Conceptual Modeling Approach to Semantic Document Retrieval -- Multidimensional Semistructured Data: Representing Context-Dependent Information on the Web -- The Role of Semantic Relevance in Dynamic User Community Management and the Formulation of Recommendations -- System Qualities -- Can We Ever Build Survivable Systems from COTS Components? -- Towards a Data Model for Quality Management Web Services: An Ontology of Measurement for Enterprise Modeling -- A Modelling Approach to the Realisation of Modular Information Spaces -- Integration Issues -- Data Integration under Integrity Constraints -- Babel: An XML-Based Application Integration Framework -- Integrating and Rapid-Prototyping UML Structural and Behavioural Diagrams Using Rewriting Logic -- Analysis and Adaptation -- Verification of Payment Protocols via MultiAgent Model Checking -- SNet: A Modeling and Simulation Environment for Agent Networks Based on i* and ConGolog -- Usage—Centric Adaptation of Dynamic E—Catalogs -- Retrieval and Performance -- Reengineering of Database Applications to EJB Based Architecture -- Efficient Similarity Search for Time Series Data Based on the Minimum Distance -- A High-Performance Data Structure for Mobile Information Systems -- Requirements Issues -- External Requirements Validation for Component-Based Systems -- Using Business Rules in Extreme Requirements -- Evaluating CM3: Problem Management -- Schema Matching and Evolution -- Database Schema Matching Using Machine Learning with Feature Selection -- Evolving Partitions in Conceptual Schemas in the UML -- Schema Evolution in Heterogeneous Database Architectures, A Schema Transformation Approach -- Workflows -- Serviceflow Beyond Workflow? Concepts and Architectures for Supporting Inter-Organizational Service Processes -- Design for Change: Evolving Workflow Specifications in ULTRAflow -- An Alternative Way to Analyze Workflow Graphs -- Semantics and Logical Representations -- Auditing Interval-Based Inference -- A Logical Foundation for XML -- Providing the Semantic Layer for WIS Design -- Understanding and Using Methods -- Towards a Framework for Comparing Process Modelling Languages -- Generic Models for Engineering Methods of Diverse Domains -- Role of Model Transformation in Method Engineering -- Modeling Objects and Relationships -- A Generic Role Model for Dynamic Objects -- Understanding Redundancy in UML Models for Object-Oriented Analysis -- Representation of Generic Relationship Types in Conceptual Modeling -- Short Papers -- Building Spatio-Temporal Presentations Warehouses from Heterogeneous Multimedia Web Servers -- A Practical Agent-Based Method to Extract Semantic Information from the Web -- Process Inheritance -- Addressing Performance Requirements Using a Goal and Scenario-Oriented Approach -- Querying Data with Multiple Temporal Dimensions -- Query Explorativeness for Integrated Search in Heterogeneous Data Sources -- Using Nested Tables for Representing and Querying Semistructured Web Data -- Defining and Validating Measures for Conceptual Data Model Quality -- An Architecture for Building Multi-device Thin-Client Web User Interfaces -- A Framework for Tool—Independent Modeling of Data Acquisition Processes for Data Warehousing -- Managing Complexity of Designing Routing Protocols Using a Middleware Approach -- Deferred Incremental Refresh of XML Materialized Views -- Requirements for Hypermedia Development Methods: A Survey of Outstanding Methods -- An Approach for Synergically Carrying out Intensional and Extensional Integration of Data Sources Having Different Formats -- DSQL — An SQL for Structured Documents Extended Abstract -- A Comparative Study of Ontology Languages and Tools -- Life Cycle Based Approach for Knowledge Management: A Knowledge Organization Case Study -- Parallel Query Processing Algorithms for Semi-structured Data -- Domain-Specific Instance Models in UML -- Extended Faceted Ontologies -- On the Logical Modeling of ETL Processes -- Intelligent Agent Supported Flexible Workflow Monitoring System -- A Meeting Scheduling System Based on Open Constraint Programming.
Record Nr. UNISA-996466231803316
Berlin ; ; Heidelberg ; ; New York : , : Springer, , [2002]
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Advanced information systems engineering : 14th International Conference, CAiSE 2002 Toronto, Canada, May 27-31, 2002, proceedings / / Anne Banks Pidduck [and three others] (editors)
Advanced information systems engineering : 14th International Conference, CAiSE 2002 Toronto, Canada, May 27-31, 2002, proceedings / / Anne Banks Pidduck [and three others] (editors)
Edizione [1st ed. 2002.]
Pubbl/distr/stampa Berlin ; ; Heidelberg ; ; New York : , : Springer, , [2002]
Descrizione fisica 1 online resource (XIV, 782 p.)
Disciplina 005.73
Collana Lecture Notes in Computer Science
Soggetto topico Data structures (Computer science)
Soggetto genere / forma Electronic books.
ISBN 3-540-47961-9
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Presentations -- The Grand Challenge in Information Technology and the Illusion of Validity -- Metadata and Cooperative Knowledge Management -- Ontology-Driven Conceptual Modeling -- Metadata and Cooperative Knowledge Management -- Web Component: A Substrate for Web Service Reuse and Composition -- Developing Web Applications -- Designing Web-Based Systems in Social Context: A Goal and Scenario Based Approach -- A State Machine Based Approach for a Process Driven Development of Web-Applications -- Knowledge Management -- Supporting Dimension Updates in an OLAP Server -- The COMET Metamodel for Temporal Data Warehouses -- Exploring RDF for Expertise Matching within an Organizational Memory -- Deployment Issues -- Describing and Communicating Software Architecture in Practice: Observations on Stakeholders and Rationale -- The Individual Deployment of Systems Development Methodologies -- Supporting the Deployment of Object-Oriented Frameworks -- Semantics of Information -- A Conceptual Modeling Approach to Semantic Document Retrieval -- Multidimensional Semistructured Data: Representing Context-Dependent Information on the Web -- The Role of Semantic Relevance in Dynamic User Community Management and the Formulation of Recommendations -- System Qualities -- Can We Ever Build Survivable Systems from COTS Components? -- Towards a Data Model for Quality Management Web Services: An Ontology of Measurement for Enterprise Modeling -- A Modelling Approach to the Realisation of Modular Information Spaces -- Integration Issues -- Data Integration under Integrity Constraints -- Babel: An XML-Based Application Integration Framework -- Integrating and Rapid-Prototyping UML Structural and Behavioural Diagrams Using Rewriting Logic -- Analysis and Adaptation -- Verification of Payment Protocols via MultiAgent Model Checking -- SNet: A Modeling and Simulation Environment for Agent Networks Based on i* and ConGolog -- Usage—Centric Adaptation of Dynamic E—Catalogs -- Retrieval and Performance -- Reengineering of Database Applications to EJB Based Architecture -- Efficient Similarity Search for Time Series Data Based on the Minimum Distance -- A High-Performance Data Structure for Mobile Information Systems -- Requirements Issues -- External Requirements Validation for Component-Based Systems -- Using Business Rules in Extreme Requirements -- Evaluating CM3: Problem Management -- Schema Matching and Evolution -- Database Schema Matching Using Machine Learning with Feature Selection -- Evolving Partitions in Conceptual Schemas in the UML -- Schema Evolution in Heterogeneous Database Architectures, A Schema Transformation Approach -- Workflows -- Serviceflow Beyond Workflow? Concepts and Architectures for Supporting Inter-Organizational Service Processes -- Design for Change: Evolving Workflow Specifications in ULTRAflow -- An Alternative Way to Analyze Workflow Graphs -- Semantics and Logical Representations -- Auditing Interval-Based Inference -- A Logical Foundation for XML -- Providing the Semantic Layer for WIS Design -- Understanding and Using Methods -- Towards a Framework for Comparing Process Modelling Languages -- Generic Models for Engineering Methods of Diverse Domains -- Role of Model Transformation in Method Engineering -- Modeling Objects and Relationships -- A Generic Role Model for Dynamic Objects -- Understanding Redundancy in UML Models for Object-Oriented Analysis -- Representation of Generic Relationship Types in Conceptual Modeling -- Short Papers -- Building Spatio-Temporal Presentations Warehouses from Heterogeneous Multimedia Web Servers -- A Practical Agent-Based Method to Extract Semantic Information from the Web -- Process Inheritance -- Addressing Performance Requirements Using a Goal and Scenario-Oriented Approach -- Querying Data with Multiple Temporal Dimensions -- Query Explorativeness for Integrated Search in Heterogeneous Data Sources -- Using Nested Tables for Representing and Querying Semistructured Web Data -- Defining and Validating Measures for Conceptual Data Model Quality -- An Architecture for Building Multi-device Thin-Client Web User Interfaces -- A Framework for Tool—Independent Modeling of Data Acquisition Processes for Data Warehousing -- Managing Complexity of Designing Routing Protocols Using a Middleware Approach -- Deferred Incremental Refresh of XML Materialized Views -- Requirements for Hypermedia Development Methods: A Survey of Outstanding Methods -- An Approach for Synergically Carrying out Intensional and Extensional Integration of Data Sources Having Different Formats -- DSQL — An SQL for Structured Documents Extended Abstract -- A Comparative Study of Ontology Languages and Tools -- Life Cycle Based Approach for Knowledge Management: A Knowledge Organization Case Study -- Parallel Query Processing Algorithms for Semi-structured Data -- Domain-Specific Instance Models in UML -- Extended Faceted Ontologies -- On the Logical Modeling of ETL Processes -- Intelligent Agent Supported Flexible Workflow Monitoring System -- A Meeting Scheduling System Based on Open Constraint Programming.
Record Nr. UNINA-9910143908603321
Berlin ; ; Heidelberg ; ; New York : , : Springer, , [2002]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica 1 online resource (XIII, 438 p.)
Disciplina 005.73
Collana Theoretical Computer Science and General Issues
Soggetto topico Data structures (Computer science)
Discrete mathematics
Algorithms
Computer communication systems
Computer science—Mathematics
Computer graphics
Data Structures
Discrete Mathematics
Algorithm Analysis and Problem Complexity
Computer Communication Networks
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-540-69903-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation.
Record Nr. UNINA-9910484732303321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson
Algorithm Theory – SWAT 2008 [[electronic resource] ] : 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings / / edited by Joachim Gudmundsson
Edizione [1st ed. 2008.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Descrizione fisica 1 online resource (XIII, 438 p.)
Disciplina 005.73
Collana Theoretical Computer Science and General Issues
Soggetto topico Data structures (Computer science)
Discrete mathematics
Algorithms
Computer communication systems
Computer science—Mathematics
Computer graphics
Data Structures
Discrete Mathematics
Algorithm Analysis and Problem Complexity
Computer Communication Networks
Discrete Mathematics in Computer Science
Computer Graphics
ISBN 3-540-69903-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Lectures -- A Survey of Results for Deletion Channels and Related Synchronization Channels -- Nash Bargaining Via Flexible Budget Markets -- Contributed Papers -- Simplified Planar Coresets for Data Streams -- Uniquely Represented Data Structures for Computational Geometry -- I/O Efficient Dynamic Data Structures for Longest Prefix Queries -- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear -- Vision-Based Pursuit-Evasion in a Grid -- Angle Optimization in Target Tracking -- Improved Bounds for Wireless Localization -- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem -- Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint -- The Maximum Energy-Constrained Dynamic Flow Problem -- Bounded Unpopularity Matchings -- Data Structures with Local Update Operations -- On the Redundancy of Succinct Data Structures -- Confluently Persistent Tries for Efficient Version Control -- A Uniform Approach Towards Succinct Representation of Trees -- An Algorithm for L(2,1)-Labeling of Trees -- Batch Coloring Flat Graphs and Thin -- Approximating the Interval Constrained Coloring Problem -- A Path Cover Technique for LCAs in Dags -- Boundary Labeling with Octilinear Leaders -- Distributed Disaster Disclosure -- Reoptimization of Steiner Trees -- On the Locality of Extracting a 2-Manifold in -- On Metric Clustering to Minimize the Sum of Radii -- On Covering Problems of Rado -- Packing Rectangles into 2OPT Bins Using Rotations -- A Preemptive Algorithm for Maximizing Disjoint Paths on Trees -- Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs -- On a Special Co-cycle Basis of Graphs -- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs -- Spanners of Additively Weighted Point Sets -- The Kinetic Facility Location Problem -- Computing the Greedy Spanner in Near-Quadratic Time -- Parameterized Computational Complexity of Dodgson and Young Elections -- Online Compression Caching -- On Trade-Offs in External-Memory Diameter-Approximation.
Record Nr. UNISA-996465379903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
Algorithms and Computation [[electronic resource] ] : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992. Proceedings / / edited by Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita
Edizione [1st ed. 1992.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992
Descrizione fisica 1 online resource (XII, 516 p.)
Disciplina 005.73
Collana Lecture Notes in Computer Science
Soggetto topico Data structures (Computer science)
Computers
Computer mathematics
Combinatorics
Probabilities
Data Structures
Theory of Computation
Computational Mathematics and Numerical Analysis
Computation by Abstract Devices
Probability Theory and Stochastic Processes
ISBN 3-540-47501-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Methods in parallel algorithmics and who may need to know them? -- Rectilinear paths among rectilinear obstacles -- Linear time algorithms for k-cutwidth problem -- The k-edge-connectivity augmentation problem of weighted graphs -- Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity -- The application of the searching over separators strategy to solve some NP-complete problems on planar graphs -- Parallel and on-line graph coloring algorithms -- Competitive analysis of the Round Robin algorithm -- Competitive analysis of the on-line algorithms for multiple stacks systems -- Self-adjusting augmented search trees -- Algorithms for a class of Min-Cut and Max-Cut problem -- Algorithms for rectilinear optimal multicast tree problem -- Approximating treewidth and pathwidth of some classes of perfect graphs -- Graph spanners and connectivity -- Randomized range-maxima in nearly-constant parallel time -- Fault-tolerant broadcasting in binary jumping networks -- Routing problems on the mesh of buses -- Selection networks with 8n log2 n size and O(log n) depth -- Relativizations of the P=? NP and other problems: Some developments in structural complexity theory -- Boolean circuit complexity -- Searching a solid pseudo 3-sided orthoconvex grid -- An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects -- Topologically consistent algorithms related to convex polyhedra -- Characterizing and recognizing visibility graphs of Funnel-shaped polygons -- On the complexity of composite numbers -- On malign input distributions for algorithms -- Lowness and the complexity of sparse and tally descriptions -- Honest iteration schemes of randomizing algorithms -- Approximating vertices of a convex polygon with grid points in the polygon -- Algorithms for determining the geometrical congruity in two and three dimensions -- On the relationships among constrained geometric structures -- Generating small convergent systems can be extremely hard -- Chew's theorem revisited — uniquely normalizing property of nonlinear term rewriting systems -- Higher order communicating processes with Value-Passing, Assignment and return of results -- Searching informed game trees -- How to generate realistic sample problems for network optimization -- Generalized assignment problems -- Recognizing an envelope of lines in linear time -- Approximation of polygonal curves with minimum number of line segments -- Wiring knock-knee layouts: A global approach -- Algorithms for finding non-crossing paths with minimum total length in plane graphs -- On symmetry of information and polynomial time invertibility -- On probabilistic ACC circuits with an exact-threshold output gate -- Computational and statistical indistinguishabilities -- On symmetric differences of NP-hard sets with weakly-P-selective sets -- Restricted track assignment with applications -- A simple test for the consecutive ones property -- The longest common subsequence problem for small alphabet size between many strings -- The implicit dictionary problem revisited -- Sorting in-place with a worst case complexity of n log n?1.3n+O(log n) comparisons and ? n log n+O(1) transports -- Sorting and/by merging finger trees.
Record Nr. UNISA-996465513903316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui