| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465670203316 |
|
|
Titolo |
Automata, Languages and Programming [[electronic resource] ] : 23rd International Colloquium, ICALP '96, Paderborn, Germany, July 8-12, 1996. Proceedings / / edited by Friedhelm Meyer auf der Heide, Burkhard Monien |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1996.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 684 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 1099 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Software engineering |
Data structures (Computer science) |
Combinatorics |
Theory of Computation |
Software Engineering/Programming and Operating Systems |
Data Structures |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
Saturation-based theorem proving (abstract) -- Bandwidth efficient parallel computation -- Variable-length maximal codes -- Lower bounds for prepositional proofs and independence results in bounded arithmetic -- Algebraic characterizations of decorated trace equivalences over tree-like structures -- Fast asynchronous systems in dense time -- A hierarchy theorem for the ?-calculus -- An effective tableau system for the linear time ?-calculus -- Characterizing fairness implementability for multiparty interaction -- Termination of context-sensitive rewriting by rewriting -- A complete gentzen-style axiomatization for set constraints -- Fatal errors in conditional expressions -- Different types of arrow between logical frameworks -- Effective models of polymorphism, subtyping and recursion (extended abstract) -- Regularity for a large class of context-free processes is decidable -- On infinite transition graphs having a decidable monadic |
|
|
|
|
|
|
|
|
|
|
|
theory -- Semi-groups acting on context-free graphs -- Hard sets method and semilinear reservoir method with applications -- Random polynomials and polynomial factorization -- Optimal gröbner base algorithms for binomial ideals -- Minimum fill-in on circle and circular-arc graphs -- Practical approximation schemes for maximum induced-subgraph problems on K 3,3-free or K 5-free graphs -- Searching a fixed graph -- Improved sampling with applications to dynamic graph algorithms -- The expressive power of existential first order sentences of büchi's sequential calculus -- Fixpoints for rabin tree automata make complementation easy -- New upper bounds to the limitedness of distance automata -- Recognizing regular expressions by means of dataflow networks -- On the power of randomized branching programs -- Hitting sets derandomize BPP -- On type-2 probabilistic quantifiers -- Speeding-up single-tape nondeterministic computations by single alternation, with separation results -- On ?-generators and codes -- On standard Sturmian morphisms -- Constructions and bounds for visual cryptography -- On capital investment -- Lower bounds for static dictionaries on RAMs with bit operations but no multiplication -- Lower bounds for row minima searching -- On the complexity of relational problems for finite state processes -- Deciding finiteness of Petri nets up to bisimulation -- Mobile processes with a distributed environment -- The meaning of negative premises in transition system specifications II -- Average case analyses of list update algorithms, with applications to data compression -- Self-organizing data structures with dependent accesses -- Lopsided trees: Analyses, algorithms, and applications -- Optimal logarithmic time randomized suffix tree construction -- Improved parallel approximation of a class of integer programming problems -- Efficient collective communication in optical networks -- Shared-memory simulations on a faulty-memory DMM -- Fast deterministic backtrack search -- Agent rendezvous: A dynamic symmetry-breaking problem -- Efficient asynchronous consensus with the value-oblivious adversary scheduler -- A formal framework for evaluating heuristic programs -- Improved scheduling algorithms for minsum criteria -- On the complexity of string folding -- A polynomial-time algorithm for near-perfect phylogeny. |
|
|
|
|
|
|
Sommario/riassunto |
|
This volume constitutes the refereed proceedings of the 23rd International Colloquium on Automata, Languages and Programming (ICALP '96), held at Paderborn, Germany, in July 1996. ICALP is an annual conference sponsored by the European Association on Theoretical Computer Science (EATCS). The proceedings contain 52 refereed papers selected from 172 submissions and 4 invited papers. The papers cover the whole range of theoretical computer science; they are organized in sections on: Process Theory; Fairness, Domination, and the u-Calculus; Logic and Algebra; Languages and Processes; Algebraic Complexity; Graph Algorithms; Automata; Complexity Theory; Combinatorics on Words; Algorithms; Lower Bounds; Data Structures... |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996464512303316 |
|
|
Titolo |
Wireless Algorithms, Systems, and Applications [[electronic resource] ] : 16th International Conference, WASA 2021, Nanjing, China, June 25–27, 2021, Proceedings, Part I / / edited by Zhe Liu, Fan Wu, Sajal K. Das |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2021.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (653 pages) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 12937 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer networks |
Application software |
Computer systems |
Artificial intelligence |
Computers, Special purpose |
Software engineering |
Computer Communication Networks |
Computer and Information Systems Applications |
Computer System Implementation |
Artificial Intelligence |
Special Purpose and Application-Based Systems |
Software Engineering |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Wireless Communications -- Blockchain -- Algorithms -- IoT and Edge Computing -- Scheduling & Optimization I. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
The three-volume set LNCS 12937 - 12939 constitutes the proceedings of the 16th International Conference on Wireless Algorithms, Systems, and Applications, WASA 2021, which was held during June 25-27, 2021. The conference took place in Nanjing, China. The 103 full and 57 short papers presented in these proceedings were carefully reviewed and selected from 315 submissions. The following topics are covered in |
|
|
|
|
|
|
|
|
|
|
Part I of the set: network protocols, signal processing, wireless telecommunication systems, blockchain, IoT and edge computing, artificial intelligence, computer security, distributed computer systems, machine learning, and others. |
|
|
|
|
|
| |