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 : fifth colloquium : Udine, July 17-21 1978 / edited by G. Ausiello and C. Bohm
| Automata, languages and programming : fifth colloquium : Udine, July 17-21 1978 / edited by G. Ausiello and C. Bohm |
| Autore | Colloquium on automata, languages and programming <5.; Udine; 1978> |
| Pubbl/distr/stampa | Berlin : Springer Verlag, 1978 |
| Descrizione fisica | VIII, 508 p. : ill. ; 24 cm |
| Disciplina | 001.642 |
| Collana | Lecture notes in computer science |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000349710203316 |
Colloquium on automata, languages and programming <5.; Udine; 1978>
|
||
| Berlin : Springer Verlag, 1978 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, languages and programming : eighth colloquium Acre (Akko), Israel, July 13-17, 1981 / edited by S. Even and O. Kariv
| Automata, languages and programming : eighth colloquium Acre (Akko), Israel, July 13-17, 1981 / edited by S. Even and O. Kariv |
| Autore | Colloquium on automata, languages and programming <8.; Acre (Akko), Israel; 1981> |
| Pubbl/distr/stampa | Berlin : Springer Verlag, 1981 |
| Descrizione fisica | VIII, 550 p. : ill. ; 24 cm |
| Disciplina | 001.642 |
| Collana | Lecture notes in computer science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000350380203316 |
|
Colloquium on automata, languages and programming <8.; Acre (Akko), Israel; 1981>
|
||
| Berlin : Springer Verlag, 1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, languages and programming : ninth colloquium Aarhus, Denmark July 12-16, 1982 / edited by N. Nielsen and E.M. Schmidt
| Automata, languages and programming : ninth colloquium Aarhus, Denmark July 12-16, 1982 / edited by N. Nielsen and E.M. Schmidt |
| Pubbl/distr/stampa | Berlin : Springer Verlag, 1982 |
| Descrizione fisica | VII, 613 p. : graf. ; 24 cm |
| Disciplina | 001.642 |
| Collana | Lecture notes in computer science |
| Soggetto non controllato |
Linguaggio
Congressi |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000350720203316 |
| Berlin : Springer Verlag, 1982 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, languages and programming : colloquium, Aarhus, Denmark, July 12-16, 1982 / / edited by M. Nielsen and E. M. Schmidt
| Automata, languages and programming : colloquium, Aarhus, Denmark, July 12-16, 1982 / / edited by M. Nielsen and E. M. Schmidt |
| Edizione | [1st ed. 1982.] |
| Pubbl/distr/stampa | Berlin ; ; Heidelberg : , : Springer-Verlag, , [1982] |
| Descrizione fisica | 1 online resource (VII, 616 p.) |
| Disciplina | 001.642 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Computer programming |
| ISBN | 3-540-39308-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Locality in modular systems -- On-the-fly garbage collection: New algorithms inspired by program proofs -- Algebraic specifications for parametrized data types with minimal parameter and target algebras -- A modification of the ?-calculus as a base for functional programming languages -- On the power of nondeterminism in dynamic logic -- Equivalence and membership problems for regular trace languages -- On the power of chain rules in context free grammars -- Extended Chomsky-Schützenberger theorems -- Real time agents -- Machine inductive inference and language identification -- Approximations of infinitary objects -- On test sets and the Ehrenfeucht conjecture -- An automata-theoretic characterization of the OI-hierarchy -- Fast detection of polyhedral intersections -- On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store -- Multihead finite state automata am concatenation -- Conditions enforcing regularity of context-free languages -- Repetitions in homomorphisms and languages -- Parameter passing commutes with implementation of parameterized data types -- An operational semantics for pure dataflow -- Some properties of D-continuous causal nets -- A branching process arising in dynamic hashing, trie searching and polynomial factorization -- A sound and complete HOARE axiomatization of the ADA-rendezvous -- Universal realization, persistent interconnection and implementation of abstract modules -- Heaps on heaps -- A boundary of isomorphism completeness in the lattice of semigroup pseudovarieties -- Derived Pairs, overlap closures, and rewrite dominoes: New tools for analyzing term rewriting systems -- A programming language for the inductive sets, and applications -- A lower bound for the formula size of rational functions -- On the equivalence problem for binary DOL systems -- Results on the propositional ?-calculus -- An iteration theorem for simple precedence languages -- The power of non-rectilinear holes -- Fixed-point semantics for algebraic (tree) grammars -- Completing biprefix codes -- Advances in pebbling -- A powerdomain for countable non-determinism -- Properties of a notation for combining functions -- On the power of probabilistic choice in synchronous parallel computations -- Biprefix codes and semisimple algebras -- Algorithmic theories of data structures -- Implementation of parameterised specifications -- Algebraic semantics of recursive flowchart schemes -- The complexity of promise problems -- Global and local invariants in transition systems -- On relativization and the existence of complete sets -- Semantics of interference control -- Efficient simulations of multicounter machines -- Event structure semantics for CCS and related languages -- Domains for denotational semantics. |
| Record Nr. | UNISA-996466353203316 |
| Berlin ; ; Heidelberg : , : Springer-Verlag, , [1982] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, languages and programming : end colloquium, University of Saarbruchen July 29-August 2, 1974 / edited by Jacques Loeckx
| Automata, languages and programming : end colloquium, University of Saarbruchen July 29-August 2, 1974 / edited by Jacques Loeckx |
| Pubbl/distr/stampa | Berlin : Springer-Verlag, 1974 |
| Descrizione fisica | 619 p. ; 24 cm |
| Disciplina | 001.642 |
| Altri autori (Persone) | Loeckx, Jacques J. C. |
| Collana | Lecture notes in computer science, 0302-9743 ; 14 |
| Soggetto topico | Programming languages - Congresses |
| ISBN | 3540068414 |
| Classificazione |
AMS 68N05
AMS 68Q45 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISALENTO-991000708219707536 |
| Berlin : Springer-Verlag, 1974 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Salento | ||
| ||
Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXXIV, 1090 p. 74 illus.) |
| Disciplina | 001.642 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43948-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Sporadic Solutions to Zero-One Exclusion Tasks -- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak Parity -- Consequences of Faster Alignment of Sequences -- Distance Labels with Optimal Local Stretch -- Time-Expanded Packings -- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM -- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average -- Tighter Relations between Sensitivity and Other Complexity Measures -- On Hardness of Jumbled Indexing -- Morphing Planar Graph Drawings Optimally -- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs -- On the Role of Shared Randomness in Simultaneous Communication -- Short PCPs with Projection Queries -- Star Partitions of Perfect Graphs -- Coordination Mechanisms for Selfish Routing over Time on a Tree -- On Area-Optimal Planar Graph Drawings -- Shortest Two Disjoint Paths in Polynomial Time -- Listing Triangles -- On DNF Approximators for Monotone Boolean Functions -- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs -- Holographic Algorithms Beyond Matchgates -- Testing Probability Distributions Underlying Aggregated Data -- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost -- The Bose-Hubbard Model is QMA-complete -- Characterization of Binary Constraint System Games -- Fast Algorithms for Constructing Maximum Entropy Summary Trees -- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems -- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile -- Canadians Should Travel Randomly -- Efficiency Guarantees in Auctions with Budgets -- Parameterized Complexity of Bandwidth on Trees -- Testing Equivalence of Polynomials under Shifts -- Optimal Analysis of Best Fit Bin Packing -- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract) -- Online Stochastic Reordering Buffer Scheduling -- Demand Queries with Preprocessing -- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs -- Public vs Private Coin in Bounded-Round Information -- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations -- Improved Submatrix Maximum Queries in Monge Matrices -- For-All Sparse Recovery in Near-Optimal Time -- Families with Infants: A General Approach to Solve Hard Partition Problems -- Changing Bases: Multistage Optimization for Matroids and Matchings -- Problems -- Nearly Linear-Time Model-Based Compressive Sensing -- Breaking the PPSZ Barrier for Unique 3-SAT -- Privately Solving Linear Programs -- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions -- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not -- Partial Garbling Schemes and Their Applications -- On the Complexity of Trial and Error for Constraint Satisfaction Problems -- Information Theoretical Cryptogenography -- The Complexity of Somewhat Approximation Resistant Predicates -- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound -- Distance Oracles for Time-Dependent Networks -- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields -- Coloring Relatives of Interval Overlap Graphs via On-line Games -- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model -- Parameterized Approximation Schemes Using Graph Widths -- FPTAS for Weighted Fibonacci Gates and Its Applications -- Parameterized Algorithms to Preserve Connectivity -- Nonuniform Graph Partitioning with Unrelated Weights -- Precedence-Constrained Scheduling of Malleable Jobs with Preemption -- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability -- QCSP on Semicomplete Digraphs -- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract] -- Determining Majority in Networks with Local Interactions and Very Small Local Memory -- Lower Bounds for Oblivious Subspace Embedding -- Secure Computation Using Leaky Tokens -- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem -- A Faster Parameterized Algorithm for Treedepth -- Pseudorandom Graphs in Data Structures -- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications -- The Mondshein Sequence -- Balanced Allocations: A Simple Proof for the Heavily Loaded Case -- Close to Uniform Prime Number Generation with Fewer Random Bits -- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs -- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Extended Abstract) -- On Learning, Lower Bounds and (un)Keeping Promises -- Certificates in Data Structures -- Optimal Query Complexity for Estimating the Trace of a Matrix -- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles -- Spatial Mixing of Coloring Random Graphs. |
| Record Nr. | UNISA-996200139803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias
| Automata, Languages, and Programming [[electronic resource] ] : 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I / / edited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XXXIV, 1090 p. 74 illus.) |
| Disciplina | 001.642 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science Computer networks Information storage and retrieval systems Application software Computer science—Mathematics Discrete mathematics Theory of Computation Computer Communication Networks Information Storage and Retrieval Computer and Information Systems Applications Discrete Mathematics in Computer Science |
| ISBN | 3-662-43948-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Sporadic Solutions to Zero-One Exclusion Tasks -- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak Parity -- Consequences of Faster Alignment of Sequences -- Distance Labels with Optimal Local Stretch -- Time-Expanded Packings -- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM -- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average -- Tighter Relations between Sensitivity and Other Complexity Measures -- On Hardness of Jumbled Indexing -- Morphing Planar Graph Drawings Optimally -- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs -- On the Role of Shared Randomness in Simultaneous Communication -- Short PCPs with Projection Queries -- Star Partitions of Perfect Graphs -- Coordination Mechanisms for Selfish Routing over Time on a Tree -- On Area-Optimal Planar Graph Drawings -- Shortest Two Disjoint Paths in Polynomial Time -- Listing Triangles -- On DNF Approximators for Monotone Boolean Functions -- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs -- Holographic Algorithms Beyond Matchgates -- Testing Probability Distributions Underlying Aggregated Data -- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost -- The Bose-Hubbard Model is QMA-complete -- Characterization of Binary Constraint System Games -- Fast Algorithms for Constructing Maximum Entropy Summary Trees -- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems -- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile -- Canadians Should Travel Randomly -- Efficiency Guarantees in Auctions with Budgets -- Parameterized Complexity of Bandwidth on Trees -- Testing Equivalence of Polynomials under Shifts -- Optimal Analysis of Best Fit Bin Packing -- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract) -- Online Stochastic Reordering Buffer Scheduling -- Demand Queries with Preprocessing -- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs -- Public vs Private Coin in Bounded-Round Information -- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations -- Improved Submatrix Maximum Queries in Monge Matrices -- For-All Sparse Recovery in Near-Optimal Time -- Families with Infants: A General Approach to Solve Hard Partition Problems -- Changing Bases: Multistage Optimization for Matroids and Matchings -- Problems -- Nearly Linear-Time Model-Based Compressive Sensing -- Breaking the PPSZ Barrier for Unique 3-SAT -- Privately Solving Linear Programs -- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions -- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not -- Partial Garbling Schemes and Their Applications -- On the Complexity of Trial and Error for Constraint Satisfaction Problems -- Information Theoretical Cryptogenography -- The Complexity of Somewhat Approximation Resistant Predicates -- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound -- Distance Oracles for Time-Dependent Networks -- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields -- Coloring Relatives of Interval Overlap Graphs via On-line Games -- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model -- Parameterized Approximation Schemes Using Graph Widths -- FPTAS for Weighted Fibonacci Gates and Its Applications -- Parameterized Algorithms to Preserve Connectivity -- Nonuniform Graph Partitioning with Unrelated Weights -- Precedence-Constrained Scheduling of Malleable Jobs with Preemption -- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability -- QCSP on Semicomplete Digraphs -- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract] -- Determining Majority in Networks with Local Interactions and Very Small Local Memory -- Lower Bounds for Oblivious Subspace Embedding -- Secure Computation Using Leaky Tokens -- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem -- A Faster Parameterized Algorithm for Treedepth -- Pseudorandom Graphs in Data Structures -- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications -- The Mondshein Sequence -- Balanced Allocations: A Simple Proof for the Heavily Loaded Case -- Close to Uniform Prime Number Generation with Fewer Random Bits -- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs -- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Extended Abstract) -- On Learning, Lower Bounds and (un)Keeping Promises -- Certificates in Data Structures -- Optimal Query Complexity for Estimating the Trace of a Matrix -- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles -- Spatial Mixing of Coloring Random Graphs. |
| Record Nr. | UNINA-9910484091103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Axiomatising the logic of computer programming / Robert Goldblatt
| Axiomatising the logic of computer programming / Robert Goldblatt |
| Autore | GOLDBLATT, Robert |
| Pubbl/distr/stampa | Berlin : Springer Verlag, 1982 |
| Descrizione fisica | XI, 304 p. : graf. ; 24 cm |
| Disciplina | 001.642 |
| Collana | Lecture notes in computer science |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000350780203316 |
|
GOLDBLATT, Robert
|
||
| Berlin : Springer Verlag, 1982 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
BASIC : programmation des microordinateurs / Alain Checroun
| BASIC : programmation des microordinateurs / Alain Checroun |
| Autore | CHECROUN, Alain |
| Pubbl/distr/stampa | Paris : Dunod, 1981 |
| Descrizione fisica | 90 p. : tab. ; 24 cm |
| Disciplina | 001.642 |
| Collana | Phase formation Dunod Informatique |
| Soggetto non controllato |
Elaboratori elettronici
Microelaboratori elettronici |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | fre |
| Record Nr. | UNISA-990000362190203316 |
|
CHECROUN, Alain
|
||
| Paris : Dunod, 1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Basic by design : structured computer programming in Basic / Andrew Kitchen
| Basic by design : structured computer programming in Basic / Andrew Kitchen |
| Autore | KITCHEN, Andrew |
| Pubbl/distr/stampa | Englewood Cliffs : Prentice Hall, c1983 |
| Descrizione fisica | XVII, 489 p. : ill. ; 23 cm |
| Disciplina | 001.642 |
| Soggetto non controllato |
Elkaboratori elettronici
Elaboratori elettronici |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000363880203316 |
|
KITCHEN, Andrew
|
||
| Englewood Cliffs : Prentice Hall, c1983 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
