Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Automata, Languages and Programming [[electronic resource] ] : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen
| Automata, Languages and Programming [[electronic resource] ] : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 1086 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer communication systems Computer science—Mathematics Computer graphics Combinatorics Software Engineering/Programming and Operating Systems Theory of Computation Computer Communication Networks Mathematics of Computing Computer Graphics |
| ISBN | 3-540-48224-5 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote Papers -- Algorithms, Games, and the Internet -- Automata, Circuits, and Hybrids: Facets of Continuous Time -- Invited Papers -- Languages, Rewriting Systems, and Verification of Infinite-State Systems -- Integrating Semantics for Object—Oriented System Models -- Modelling with Partial Orders — Why and Why Not? -- Theoretical Aspects of Evolutionary Algorithms -- Algebraic and Circuit Complexity -- Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical -- On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities -- Division Is In Uniform TC0 -- Algorithm Analysis -- A Framework for Index Bulk Loading and Dynamization -- A Characterization of Temporal Locality and Its Portability across Memory Hierarchies -- The Complexity of Constructing Evolutionary Trees Using Experiments -- Hidden Pattern Statistics -- Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence -- All-Pairs Shortest Paths Computation in the BSP Model -- Approximation and Optimization -- Approximating the Minimum Spanning Tree Weight in Sublinear Time -- Approximation Hardness of TSP with Bounded Metrics -- The RPR 2 Rounding Technique for Semidefinite Programs -- Approximation Algorithms for Partial Covering Problems -- On the Online Bin Packing Problem -- Quick k-Median, k-Center, and Facility Location for Sparse Graphs -- Complexity -- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems -- Subexponential Parameterized Algorithms Collapse the W-Hierarchy -- Improved Lower Bounds on the Randomized Complexity of Graph Properties -- New Imperfect Random Source with Applications to Coin-Flipping -- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently -- Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations -- On Interactive Proofs with a Laconic Prover -- Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness -- Lower Bounds in the Quantum Cell Probe Model -- Concurrency -- Axiomatizations for Probabilistic Bisimulation -- Noninterference for Concurrent Programs -- Distributed Controller Synthesis for Local Specifications -- A Distributed Abstract Machine for Safe Ambients -- Towards Quantitative Verification of Probabilistic Transition Systems -- Efficient Datastructures -- Efficient Generation of Plane Triangulations without Repetitions -- The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations -- Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher -- A New Method for Balancing Binary Search Trees -- Graph Algorithms -- Permutation Editing and Matching via Embeddings -- Testing Hypergraph Coloring -- Total Colorings of Degenerated Graphs -- Decidable Properties of Graphs of All-Optical Networks -- Majority Consensus and the Local Majority Rule -- Language Theory, Codes, and Automata -- Solvability of Equations in Free Partially Commutative Groups Is decidable -- Rational Transformations of Formal Power Series -- Combinatorics of Three-Interval Exchanges -- Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages -- The Star Problem in Trace Monoids: Reductions Beyond C4 -- The Trace Coding Problem Is Undecidable -- Combinatorics of Periods in Strings -- Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct -- Model Checking and Protocol Analysis -- Effective Lossy Queue Languages -- Model Checking of Unrestricted Hierarchical State Machines -- Symbolic Trace Analysis of Cryptographic Protocols -- Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols -- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata -- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width -- From Finite State Communication Protocols to High-Level Message Sequence Charts -- Networks and Routing -- Fractional Path Coloring with Applications to WDM Networks -- Performance Aspects of Distributed Caches Using TTL-Based Consistency -- Routing in Trees -- Online Packet Routing on Linear Arrays and Rings -- Faster Gossiping on Butterflies -- Reasoning and Verification -- Realizability and Verification of MSC Graphs -- Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs -- A Set-Theoretic Framework for Assume-Guarantee Reasoning -- Foundations for Circular Compositional Reasoning -- Scheduling -- A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines -- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts -- On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates -- On the Approximability of Average Completion Time Scheduling under Precedence Constraints -- Secure Computation -- Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds -- Information-Theoretic Private Information Retrieval: A Unified Construction -- Secure Multiparty Computation of Approximations -- Secure Games with Polynomial Expressions -- Specification and Deduction -- On the Completeness of Arbitrary Selection Strategies for Paramodulation -- An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS -- Knuth-Bendix Constraint Solving Is NP-Complete -- Amalgamation in CASL via Enriched Signatures -- Structural Complexity -- Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution -- Time and Space Bounds for Reversible Simulation -- Finite-State Dimension -- The Complexity of Computing the Size of an Interval -- Communication Gap for Finite Memory Devices -- Separating Quantum and Classical Learning. |
| Record Nr. | UNISA-996465891203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages and Programming : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen
| Automata, Languages and Programming : 28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings / / edited by Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (XIV, 1086 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer communication systems Computer science—Mathematics Computer graphics Combinatorics Software Engineering/Programming and Operating Systems Theory of Computation Computer Communication Networks Mathematics of Computing Computer Graphics |
| ISBN | 3-540-48224-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Keynote Papers -- Algorithms, Games, and the Internet -- Automata, Circuits, and Hybrids: Facets of Continuous Time -- Invited Papers -- Languages, Rewriting Systems, and Verification of Infinite-State Systems -- Integrating Semantics for Object—Oriented System Models -- Modelling with Partial Orders — Why and Why Not? -- Theoretical Aspects of Evolutionary Algorithms -- Algebraic and Circuit Complexity -- Improvements of the Alder—Strassen Bound: Algebras with Nonzero Radical -- On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities -- Division Is In Uniform TC0 -- Algorithm Analysis -- A Framework for Index Bulk Loading and Dynamization -- A Characterization of Temporal Locality and Its Portability across Memory Hierarchies -- The Complexity of Constructing Evolutionary Trees Using Experiments -- Hidden Pattern Statistics -- Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence -- All-Pairs Shortest Paths Computation in the BSP Model -- Approximation and Optimization -- Approximating the Minimum Spanning Tree Weight in Sublinear Time -- Approximation Hardness of TSP with Bounded Metrics -- The RPR 2 Rounding Technique for Semidefinite Programs -- Approximation Algorithms for Partial Covering Problems -- On the Online Bin Packing Problem -- Quick k-Median, k-Center, and Facility Location for Sparse Graphs -- Complexity -- Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems -- Subexponential Parameterized Algorithms Collapse the W-Hierarchy -- Improved Lower Bounds on the Randomized Complexity of Graph Properties -- New Imperfect Random Source with Applications to Coin-Flipping -- Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently -- Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations -- On Interactive Proofs with a Laconic Prover -- Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness -- Lower Bounds in the Quantum Cell Probe Model -- Concurrency -- Axiomatizations for Probabilistic Bisimulation -- Noninterference for Concurrent Programs -- Distributed Controller Synthesis for Local Specifications -- A Distributed Abstract Machine for Safe Ambients -- Towards Quantitative Verification of Probabilistic Transition Systems -- Efficient Datastructures -- Efficient Generation of Plane Triangulations without Repetitions -- The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations -- Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher -- A New Method for Balancing Binary Search Trees -- Graph Algorithms -- Permutation Editing and Matching via Embeddings -- Testing Hypergraph Coloring -- Total Colorings of Degenerated Graphs -- Decidable Properties of Graphs of All-Optical Networks -- Majority Consensus and the Local Majority Rule -- Language Theory, Codes, and Automata -- Solvability of Equations in Free Partially Commutative Groups Is decidable -- Rational Transformations of Formal Power Series -- Combinatorics of Three-Interval Exchanges -- Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages -- The Star Problem in Trace Monoids: Reductions Beyond C4 -- The Trace Coding Problem Is Undecidable -- Combinatorics of Periods in Strings -- Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct -- Model Checking and Protocol Analysis -- Effective Lossy Queue Languages -- Model Checking of Unrestricted Hierarchical State Machines -- Symbolic Trace Analysis of Cryptographic Protocols -- Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols -- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata -- Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width -- From Finite State Communication Protocols to High-Level Message Sequence Charts -- Networks and Routing -- Fractional Path Coloring with Applications to WDM Networks -- Performance Aspects of Distributed Caches Using TTL-Based Consistency -- Routing in Trees -- Online Packet Routing on Linear Arrays and Rings -- Faster Gossiping on Butterflies -- Reasoning and Verification -- Realizability and Verification of MSC Graphs -- Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs -- A Set-Theoretic Framework for Assume-Guarantee Reasoning -- Foundations for Circular Compositional Reasoning -- Scheduling -- A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines -- The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts -- On Minimizing Average Weighted Completion Time of Multiprocessor Tasks with Release Dates -- On the Approximability of Average Completion Time Scheduling under Precedence Constraints -- Secure Computation -- Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds -- Information-Theoretic Private Information Retrieval: A Unified Construction -- Secure Multiparty Computation of Approximations -- Secure Games with Polynomial Expressions -- Specification and Deduction -- On the Completeness of Arbitrary Selection Strategies for Paramodulation -- An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS -- Knuth-Bendix Constraint Solving Is NP-Complete -- Amalgamation in CASL via Enriched Signatures -- Structural Complexity -- Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution -- Time and Space Bounds for Reversible Simulation -- Finite-State Dimension -- The Complexity of Computing the Size of an Interval -- Communication Gap for Finite Memory Devices -- Separating Quantum and Classical Learning. |
| Record Nr. | UNINA-9910143600103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer Science Today [[electronic resource] ] : Recent Trends and Developments / / edited by Jan van Leeuwen
| Computer Science Today [[electronic resource] ] : Recent Trends and Developments / / edited by Jan van Leeuwen |
| Edizione | [1st ed. 1995.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
| Descrizione fisica | 1 online resource (XV, 645 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Education—Data processing Theory of Computation Computers and Education |
| ISBN | 3-540-49435-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A quantum jump in computer science -- Artificial life and real world computing -- Recurrent neural networks -- Scalable computing -- Efficient use of parallel & distributed systems: From theory to practice -- Experimental validation of models of parallel computation -- Quo vadetis, parallel machine models? -- Templates for linear algebra problems -- The ART behind IDEAS -- Algorithmic number theory and its relationship to computational complexity -- Edge-coloring algorithms -- Towards a computational theory of genome rearrangements -- Algebraic topology and distributed computing a primer -- Differential BDDs -- Algorithmic techniques for geometric optimization -- All the needles in a haystack: Can exhaustive search overcome combinatorial chaos? -- Fundamental limitations on search algorithms: Evolutionary computing in perspective -- Mathematical system models as a basis of software engineering -- Formulations and formalisms in software architecture -- The Oz Programming Model -- Standard Generalized Markup Language: Mathematical and philosophical issues -- Avoiding the undefined by underspecification -- Towards a theory of recursive structures -- Chu spaces and their interpretation as concurrent objects -- Abstracting unification: A key step in the design of logic program analyses -- Programming Satan's computer -- Petri Net models of distributed algorithms -- Symmetry and induction in model checking -- Alternating automata and program verification -- Reasoning about actions and change with ramification -- Trends in active vision -- Computational machine learning in theory and praxis -- Fuzzy sets as a tool for modeling -- Information retrieval and informative reasoning -- Database transaction models -- Multimedia authoring tools: State of the art and research challenges -- Computational models for distributed multimedia applications -- Hypermedia systems as internet tools. |
| Record Nr. | UNISA-996466127403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings. / / edited by Jan van Leeuwen, Nicola Santoro
| Distributed Algorithms [[electronic resource] ] : 4th International Workshop, Bari, Italy, September 24-26, 1990. Proceedings. / / edited by Jan van Leeuwen, Nicola Santoro |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (VIII, 436 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer programming Algorithms Computer communication systems Operating systems (Computers) Theory of Computation Computation by Abstract Devices Programming Techniques Algorithm Analysis and Problem Complexity Computer Communication Networks Operating Systems |
| ISBN | 3-540-47405-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Self-stabilizing ring orientation -- Memory-efficient self stabilizing protocols for general networks -- On the computational power needed to elect a leader -- Spanning tree construction for nameless networks -- A linear fault-tolerant naming algorithm -- Distributed data structures: A complexity-oriented view -- An improved algorithm to detect communication deadlocks in distributed systems -- On the average performance of synchronized programs in distributed networks -- Distributed algorithms for reconstructing MST after topology change -- Efficient distributed algorithms for single-source shortest paths and related problems on plane networks -- Stepwise development of a distributed load balancing algorithm -- Greedy packet scheduling -- Optimal computation of global sensitive functions in fast networks -- Efficient mechanism for fairness and deadlock-avoidance in high-speed networks -- Strong verifiable secret sharing extended abstract -- Weak consistency and pessimistic replica control -- Localized-access protocols for replicated databases -- Weighted voting for operation dependent management of replicated data -- Wakeup under read/write atomicity -- Time and message efficient reliable broadcasts -- Early-stopping distributed bidding and applications -- Fast consensus in networks of bounded degree -- Common knowledge and consistent simultaneous coordination -- Agreement on the group membership in synchronous distributed systems -- Tight bounds on the round complexity of distributed 1-solvable tasks -- A time-randomness tradeoff for communication complexity -- Bounds on the costs of register implementations -- A bounded first-in, first-enabled solution to the l-exclusion problem. |
| Record Nr. | UNISA-996465439503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987. Proceedings / / edited by Jan van Leeuwen
| Distributed Algorithms [[electronic resource] ] : 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987. Proceedings / / edited by Jan van Leeuwen |
| Edizione | [1st ed. 1988.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
| Descrizione fisica | 1 online resource (VII, 432 p.) |
| Disciplina | 511.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Combinatorics
Computer communication systems Data structures (Computer science) Algorithms Computer graphics Computer Communication Networks Data Structures and Information Theory Algorithm Analysis and Problem Complexity Data Structures Computer Graphics |
| ISBN | 3-540-39239-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A distributed spanning tree algorithm -- Directed network protocols -- Fault tolerant queries in computer networks -- General and efficient decentralized consensus protocols -- A framework for agreement -- Byzantine firing squad using a faulty external source -- An improved multiple identification algorithm for synchronous broadcasting networks -- Distributed algorithms for tree pattern matching -- On the packet complexity of distributed selection -- Load balancing in a network of transputers -- Experience with a new distributed termination detection algorithm -- A distributed deadlock avoidance technique -- How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion -- Verification of connection-management protocols -- Generalized scheme for topology-update in dynamic networks -- Local fail-safe network reset procedure -- Synchronizing asynchronous bounded delay networks -- A modular proof of correctness for a network synchronizer -- On the use of synchronizers for asynchronous communication networks -- Atomic multireader register -- An optimistic resiliency control scheme for distributed database systems -- A failsafe scheme for replicated information -- Randomized function evaluation on a ring -- A distributed ring orientation algorithm -- Constructing efficient election algorithms from efficient traversal algorithms -- Optimal resilient ring election algorithms -- Fault-tolerant distributed algorithm for election in complete networks -- Lower bounds for synchronous networks and the advantage of local information -- On the existence of generic broadcast algorithms in networks of Communicating Sequential Processes -- Stepwise removal of virtual channels in distributed algorithms. |
| Record Nr. | UNISA-996465690103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings / / edited by Jan van Leeuwen
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16 - 18, 1993. Proceedings / / edited by Jan van Leeuwen |
| Edizione | [1st ed. 1994.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 |
| Descrizione fisica | 1 online resource (XI, 437 p.) |
| Disciplina | 004/.01/5115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Discrete mathematics Application software Algorithms Combinatorics Computer logic Theory of Computation Discrete Mathematics Computer Applications Algorithm Analysis and Problem Complexity Logics and Meanings of Programs |
| ISBN | 3-540-48385-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Near-optimal dominating sets in dense random graphs in polynomial expected time -- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality -- Hierarchically specified unit disk graphs -- Bounded tree-width and LOGCFL -- On reduction algorithms for graphs with small treewidth -- Algorithms and complexity of sandwich problems in graphs (extended abstract) -- On-line graph algorithms for incremental compilation -- Average case analysis of fully dynamic connectivity for directed graphs -- Fully dynamic maintenance of vertex cover -- Dynamic algorithms for graphs with treewidth 2 -- Short disjoint cycles in graphs with degree constraints -- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs -- Towards a solution of the Holyer's problem -- Graphs, hypergraphs and hashing -- Coloring k-colorable graphs in constant expected parallel time -- Deciding 3-colourability in less than O(1.415n) steps -- A rainbow about T-colorings for complete graphs -- Approximating the chromatic polynomial of a graph -- Asteroidal triple-free graphs -- The parallel complexity of elimination ordering procedures -- Dually chordal graphs -- The size of reduced OBDDs and optimal read-once branching programs for almost all Boolean functions -- Regular marked Petri nets -- The asynchronous committee meeting problem -- Gossiping in vertex-disjoint paths mode in interconnection networks -- The folded Petersen network: A new versatile multiprocessor interconnection topology -- Fast load balancing in Cayley graphs and in circuits -- Concurrent flows and packet routing in Cayley graphs (Preliminary version) -- On multi-label linear interval routing schemes -- An ‘All pairs shortest paths’ distributed algorithm using 2n 2 messages -- Linear layouts of generalized hypercubes -- Graph ear decompositions and graph embeddings -- Improved bounds for the crossing numbers on surfaces of genus g -- Two algorithms for finding rectangular duals of planar graphs -- A more compact visibility representation. |
| Record Nr. | UNISA-996466261003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : International Workshop WG `88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings / / edited by Jan van Leeuwen
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : International Workshop WG `88 Amsterdam, The Netherlands, June 15-17, 1988. Proceedings / / edited by Jan van Leeuwen |
| Edizione | [1st ed. 1989.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 |
| Descrizione fisica | 1 online resource (X, 462 p.) |
| Disciplina | 511.6 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Combinatorics
Mathematics Architecture, Computer Algorithms Data structures (Computer science) Computer graphics Mathematics, general Computer System Implementation Algorithm Analysis and Problem Complexity Data Structures Computer Graphics |
| ISBN | 3-540-46076-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | NC-algorithms for graphs with small treewidth -- Graph-theoretic properties compatible with graph derivations -- The monadic second-order logic of graphs : Definable sets of finite graphs -- On systems of equations defining infinite graphs -- Fault tolerant networks of specified diameter -- DFS tree construction: Algorithms and characterizations -- Serializable graphs -- Transitive closure algorithms for very large databases -- A graph-based decomposition approach for recursive query processing -- Construction of deterministic transition graphs from dynamic integrity constraints -- (Time × space)-efficient implementations of hlerarchical conceptual models -- Dominance in the presence of obstacles -- Separating a polyhedron by one translation from a set of obstacles -- Linear time algorithms for testing approximate congruence in the plane -- Moving regular k-gons in contact -- Epsilon-nets for halfplanes -- Greedy triangulation can be efficiently implemented in the average case -- A simple systolic method to find all bridges of an undirected graph -- Colouring perfect planar graphs in parallel -- An efficient parallel algorithm for the all pairs shortest path problem -- A parallel algorithm for channel routing -- Application of graph theory to topology generation for logic gates -- On the estimate of the size of a directed graph -- The average size of ordered binary subgraphs -- O(n2) algorithms for graph planarization -- Bandwidth and profile minimization -- On the spanning trees of weighted graphs -- On paths in search or decision trees which require almost worst-case time -- A time-optimal parallel algorithm for the computing of Voronoi-diagrams -- Voronoi diagrams in the moscow metric -- A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited. |
| Record Nr. | UNISA-996465318303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1989 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
PARLE '91. Parallel Architectures and Languages Europe [[electronic resource] ] : Volume II: Parallel Languages. Eindhoven, The Netherlands, June 10-13, 1991. Proceedings / / edited by Emile H.L. Aarts, Jan van Leeuwen, Martin Rem
| PARLE '91. Parallel Architectures and Languages Europe [[electronic resource] ] : Volume II: Parallel Languages. Eindhoven, The Netherlands, June 10-13, 1991. Proceedings / / edited by Emile H.L. Aarts, Jan van Leeuwen, Martin Rem |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XVII, 495 p.) |
| Disciplina | 004.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Microprocessors
Architecture, Computer Computers Computer communication systems Special purpose computers Computer system failures Processor Architectures Computer System Implementation Theory of Computation Computer Communication Networks Special Purpose and Application-Based Systems System Performance and Evaluation |
| ISBN | 3-540-47472-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Loosely-coupled processes (preliminary version) -- Rendez-vous with metric semantics -- Embeddings among concurrent programming languages -- Invariants and paradigms of concurrency theory -- Acceptance Automata: A framework for specifying and verifying TCSP parallel systems -- Models for dynamically placed concurrent processes -- Formalisation of the behavior of actors by colored Petri nets and some applications -- Program refinement in fair transition systems -- Communication abstraction and refinement -- On the semantics of languages for massively parallel SIMD architectures -- A denotational real-time semantics for shared processors -- Concurrent clean -- The scriptic programming language -- Structural operational semantics for Kernel Andorra Prolog -- Customization of first-class tuple-spaces in a higher-order language -- A formal specification of the process trellis -- Strong bisimilarity on nets revisited -- A configuration approach to parallel programming -- Chaotic linear system solvers in a variable-grain data-driven multiprocessor system -- Parallel associative combinator evaluation -- Static analysis of term graph rewriting systems -- Scheduling of OR-parallel Prolog on a scalable, reconfigurable, distributed-memory multiprocessor -- Flexible scheduling of or-parallelism in Aurora: The Bristol scheduler -- Virtual memory support for OR-parallel logic programming systems -- Interfacing engines and schedulers in Or-Parallel Prolog systems -- Reduction of code space in parallel logic programming systems -- Search level parallel processing of production systems. |
| Record Nr. | UNISA-996465526803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics [[electronic resource] ] : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito
| Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics [[electronic resource] ] : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 636 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Programming languages (Electronic computers) Computers Computer graphics Computer communication systems Data Structures and Information Theory Programming Languages, Compilers, Interpreters Theory of Computation Data Structures Computer Graphics Computer Communication Networks |
| ISBN | 3-540-44929-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Breaking and fixing the Needham-Schroeder public-key protocol using FDR -- Reconciling Two Views of Cryptography -- Theory and Construction of Molecular Computers -- Theory and Construction of Molecular Computers -- On the hardness of the permanent -- List Decoding: Algorithms and Applications -- Approximation Algorithms for String Folding Problems -- Approximation Algorithms for String Folding Problems -- Fast multi-dimensional approximate string matching -- An Index for Two Dimensional String Matching Allowing Rotations -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs -- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- Reducibility among combinatorial problems -- Task Distributions on Multiprocessor Systems -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Steganography Using Modern Arts -- Steganography Using Modern Arts -- Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs -- Trade-Offs between Density and Robustness in Random Interconnection Graphs -- An effcient way for edge-connectivity augmentation -- The (? + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph -- On the Approximability of NP-complete Optimization Problems -- On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem -- How Many People Can Hide in a Terrain ? -- Maximum Clique and Minimum Clique Partition in Visibility Graphs -- Language recognition and the synchronization of cellular automata -- Real-Time Language Recognition by Alternating Cellular Automata -- Inducing an order on cellular automata by a grouping operation -- Damage Spreading and ?-Sensitivity on Cellular Automata -- Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods -- Discrepancy Theory and Its Application to Finance -- Fully consistent extensions of partially defined Boolean functions with missing bits -- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv -- Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key -- Characterization of Optimal Key Set Protocols -- Algebraic Complexity Theory -- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model -- On Logarithmic Simulated Annealing -- On Logarithmic Simulated Annealing -- Specification and verification of concurrent programs in CESAR -- Hierarchical State Machines -- Validating firewalls in mobile ambients -- Ambient Groups and Mobility Types -- Multiway synchronization verified with coupled simulation -- An Asynchronous, Distributed Implementation of Mobile Ambients -- Graph types for monadic mobile processes -- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness -- Aliasing Models for Mobile Objects -- Local ?-Calculus at Work: Mobile Objects as Mobile Processes -- Typed concurrent objects -- An Interpretation of Typed Concurrent Objects in the Blue Calculus -- Inductive definitions in the system coq. rules and properties -- A Higher-Order Specification of the ?-Calculus -- Compositionality through an operational semantics of contexts -- Open Ended Systems, Dynamic Bisimulation and Tile Logic -- Observe behaviour categorically -- Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems -- The Equivalence Problem for Deterministic Pushdown Automata is Decidable -- On the Complexity of Bisimulation Problems for Pushdown Automata -- Session 2.4 -- A Type-Theoretic Study on Partial Continuations -- Partially Typed Terms between Church-Style and Curry-Style -- Alternating Automata and Logics over Infinite Words -- Hypothesis Support for Information Integration in Four-Valued Logics -- Invited Talk 2.2 -- Masaccio: A Formal Model for Embedded Components -- Session 2.5 -- A Single Complete Refinement Rule for Demonic Specifications -- Reasoning about Composition Using Property Transformers and Their Conjugates -- Invited Talk 2.3 -- Some New Directions in the Syntax and Semantics of Formal Languages -- Panel Discussion on New Challanges for TCS -- New Challenges for Theoretical Computer Science -- Algorithm Design Challenges -- Quantumization of Theoretical Informatics -- Two Problems in Wide Area Network Programming -- New Challenges for Computational Models -- Towards a Computational Theory of Everything -- Open Lectures -- On the Power of Interactive Computing -- The Varieties of Programming Language Semantics. |
| Record Nr. | UNISA-996465430603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito
| Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics : International Conference IFIP TCS 2000 Sendai, Japan, August 17-19, 2000 Proceedings / / edited by Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XVI, 636 p.) |
| Disciplina | 004 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Data structures (Computer science)
Programming languages (Electronic computers) Computers Computer graphics Computer communication systems Data Structures and Information Theory Programming Languages, Compilers, Interpreters Theory of Computation Data Structures Computer Graphics Computer Communication Networks |
| ISBN | 3-540-44929-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Breaking and fixing the Needham-Schroeder public-key protocol using FDR -- Reconciling Two Views of Cryptography -- Theory and Construction of Molecular Computers -- Theory and Construction of Molecular Computers -- On the hardness of the permanent -- List Decoding: Algorithms and Applications -- Approximation Algorithms for String Folding Problems -- Approximation Algorithms for String Folding Problems -- Fast multi-dimensional approximate string matching -- An Index for Two Dimensional String Matching Allowing Rotations -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Parallel Edge Coloring of a Tree on a Mesh Connected Computer -- Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs -- Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- It Is on the Boundary: Complexity Considerations for Polynomial Ideals -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks -- Reducibility among combinatorial problems -- Task Distributions on Multiprocessor Systems -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Fast Interpolation Using Kohonen Self-Organizing Neural Networks -- Steganography Using Modern Arts -- Steganography Using Modern Arts -- Gossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs -- Trade-Offs between Density and Robustness in Random Interconnection Graphs -- An effcient way for edge-connectivity augmentation -- The (? + 1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph -- On the Approximability of NP-complete Optimization Problems -- On the Hardness of Approximating Some NP-Optimization Problems Related to Minimum Linear Ordering Problem -- How Many People Can Hide in a Terrain ? -- Maximum Clique and Minimum Clique Partition in Visibility Graphs -- Language recognition and the synchronization of cellular automata -- Real-Time Language Recognition by Alternating Cellular Automata -- Inducing an order on cellular automata by a grouping operation -- Damage Spreading and ?-Sensitivity on Cellular Automata -- Financial Applications of Monte Carlo and Quasi-Monte Carlo Methods -- Discrepancy Theory and Its Application to Finance -- Fully consistent extensions of partially defined Boolean functions with missing bits -- Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bitsv -- Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key -- Characterization of Optimal Key Set Protocols -- Algebraic Complexity Theory -- On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model -- On Logarithmic Simulated Annealing -- On Logarithmic Simulated Annealing -- Specification and verification of concurrent programs in CESAR -- Hierarchical State Machines -- Validating firewalls in mobile ambients -- Ambient Groups and Mobility Types -- Multiway synchronization verified with coupled simulation -- An Asynchronous, Distributed Implementation of Mobile Ambients -- Graph types for monadic mobile processes -- Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness -- Aliasing Models for Mobile Objects -- Local ?-Calculus at Work: Mobile Objects as Mobile Processes -- Typed concurrent objects -- An Interpretation of Typed Concurrent Objects in the Blue Calculus -- Inductive definitions in the system coq. rules and properties -- A Higher-Order Specification of the ?-Calculus -- Compositionality through an operational semantics of contexts -- Open Ended Systems, Dynamic Bisimulation and Tile Logic -- Observe behaviour categorically -- Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems -- The Equivalence Problem for Deterministic Pushdown Automata is Decidable -- On the Complexity of Bisimulation Problems for Pushdown Automata -- Session 2.4 -- A Type-Theoretic Study on Partial Continuations -- Partially Typed Terms between Church-Style and Curry-Style -- Alternating Automata and Logics over Infinite Words -- Hypothesis Support for Information Integration in Four-Valued Logics -- Invited Talk 2.2 -- Masaccio: A Formal Model for Embedded Components -- Session 2.5 -- A Single Complete Refinement Rule for Demonic Specifications -- Reasoning about Composition Using Property Transformers and Their Conjugates -- Invited Talk 2.3 -- Some New Directions in the Syntax and Semantics of Formal Languages -- Panel Discussion on New Challanges for TCS -- New Challenges for Theoretical Computer Science -- Algorithm Design Challenges -- Quantumization of Theoretical Informatics -- Two Problems in Wide Area Network Programming -- New Challenges for Computational Models -- Towards a Computational Theory of Everything -- Open Lectures -- On the Power of Interactive Computing -- The Varieties of Programming Language Semantics. |
| Record Nr. | UNINA-9910767552203321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||