Automata, Languages and Programming
24th International Colloquium, ICALP'97, Bologna, Italy, July 7 - 11, 1997, Proceedings
AvPierpaolo Degano,Roberto Gorrieri
Del i serien Lecture Notes in Computer Science
1 127 kr
Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.
Fler format och utgåvor
Beskrivning
Produktinformation
- Utgivningsdatum:1997-06-18
- Mått:155 x 235 mm
- Format:Häftad
- Språk:Engelska
- Serie:Lecture Notes in Computer Science
- Antal sidor:864
- Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- ISBN:9783540631651
Utforska kategorier
Innehållsförteckning
- Graphical calculi for interaction.- NP-completeness: A retrospective.- The LEDA platform for combinatorial and geometric computing.- The Wadge-Wagner hierarchy of ?-rational sets.- From chaotic iteration to constraint propagation.- DNA2DNA computations: A potential “killer app”?.- Tilings and quasiperiodicity.- Enumerative sequences of leaves in rational trees.- A completion algorithm for codes with bounded synchronization delay.- The expressibility of languages and relations by word equations.- Finite loops recognize exactly the regular open languages.- An abstract data type for real numbers.- Recursive computational depth.- Some bounds on the computational power of piecewise constant derivative systems (extended abstract).- Monadic simultaneous rigid E-unification and related problems.- Computability on the probability measures on the Borel sets of the unit interval.- Worst-case hardness suffices for derandomization: A new method for hardness-randomness trade-offs.- Results on resource-bounded measure.- Randomization and nondeterminism are comparable for ordered read-once branching programs.- Checking properties of polynomials.- Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP.- Game theoretic analysis of call-by-value computation.- On modular properties of higher order extensional lambda calculi.- On explicit substitutions and names (extended abstract).- On the dynamics of sharing graphs.- Minimizing diameters of dynamic trees.- Improving spanning trees by upgrading nodes.- Dynamic algorithms for graphs of bounded treewidth.- The name discipline of uniform receptiveness (extended abstract).- On confluence in the ?-calculus.- A proof theoretical approach to communication.- Solving trace equations usinglexicographical normal forms.- Star-free picture expressions are strictly weaker than first-order logic.- An algebra-based method to associate rewards with EMPA terms.- A semantics preserving actor translation.- Periodic and non-periodic min-max equations.- Efficient parallel graph algorithms for coarse grained multicomputers and BSP.- Upper bound on the communication complexity of private information retrieval.- Computation paths logic: An expressive, yet elementary, process logic.- Model checking the full modal mu-calculus for infinite sequential processes.- Symbolic model checking for probabilistic processes.- On the concentration of the height of binary search trees.- An improved master theorem for divide-and-conquer recurrences.- Bisimulation for probabilistic transition systems: A coalgebraic approach.- Distributed processes and location failures.- Basic observables for processes.- Constrained bipartite edge coloring with applications to wavelength routing.- Colouring paths in directed symmetric trees with applications to WDM routing.- On-line routing in all-optical networks.- A complete characterization of the path layout construction problem for ATM networks with given hop count and load.- Efficiency of asynchronous systems and read arcs in petri nets.- Bisimulation equivalence is decidable for one-counter processes.- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations.- Axiomatizations for the perpetual loop in process algebra.- Discrete-time control for rectangular hybrid automata.- Maintaining minimum spanning trees in dynamic graphs.- Efficient splitting and merging algorithms for order decomposable problems.- Efficient array partitioning.- Constructive linear time algorithms for branchwidth.- The word matching problem is undecidable for finite special string-rewriting systems that are confluent.- The geometry of orthogonal reduction spaces.- The theory of vaccines.- The equivalence problem for deterministic pushdown automata is decidable.- On recognizable and rational formal power series in partially commuting variables.- On a conjecture of J. Shallit.- On characterizations of escrow encryption schemes.- Randomness-efficient non-interactive zero knowledge.- Approximation results for the optimum cost chromatic partition problem.- The minimum color sum of bipartite graphs.- A primal-dual approach to approximation of node-deletion problems for matroidal properties.- Independent sets in asteroidal triple-free graphs.- Refining and compressing abstract domains.- Labelled reductions, runtime errors, and operational subsumption.- A complete and efficiently computable topological classification of D-dimensional linear cellular automata over Z m .- Recognizability equals definability for partial k-paths.- Molecular computing, bounded nondeterminism, and efficient recursion.- Constructing big trees from short sequences.- Termination of constraint logic programs.- The expressive power of unique total stable model semantics.
Mer från samma författare
Formal Methods for Computational Systems Biology
Marco Bernardo, Pierpaolo Degano, Gianluigi Zavattaro
Häftad, 2008
567 kr
Formal Methods for Computational Systems Biology
Gianluigi Zavattaro, Pierpaolo Degano, Marco Bernardo
755 kr
Formal Aspects in Security and Trust
Pierpaolo Degano, Joshua D. Guttman, Fabio Martinelli
Häftad, 2009
565 kr
Formal Aspects in Security and Trust
Fabio Martinelli, Joshua D. Guttman, Pierpaolo Degano
750 kr
Mer från samma serie
Agent Mediated Electronic Commerce II
Alexandros Moukas, Carles Sierra, Fredrik Ygge
Häftad, 2000
567 kr
Multiobjective Optimization
Jürgen Branke, Kalyanmoy Deb, Kaisa Miettinen, Roman Slowiński
Häftad, 2008
551 kr
Knowledge Graphs
Hideaki Takeda, Yannis Tzitzikas, Giorgos Flouris, Shizhu He, Dimitris Plexousakis, Sébastien Ferré, Ran Yu, Vasilis Efthymiou, Eleni Ilkou, Ernesto Jiménez-Ruiz, Xin Wang
Häftad, 2026
926 kr
Electronic Government
Ida Lindgren, Marijn Janssen, Habin Lee, Andrea Polini, Manuel Pedro Rodríguez Bolívar, Hans Jochen Scholl, Efthimios Tambouris
Häftad, 2019
822 kr
Chromatic Visions
Irina Mihaela Ciortan, Daniele Ferdani, Jon Yngve Hardeberg, Sophia Sotiropoulou, Manuele Veggi
Häftad, 2026
455 kr
Data Quality and Trust in Big Data
Hakim Hacid, Quan Z. Sheng, Tetsuya Yoshida, Azadeh Sarkheyli, Rui Zhou
Häftad, 2019
567 kr
Energy Informatics
Ivo Martinac, Bo Nørregaard Jørgensen, Zheng Grace Ma, Rúnar Unnþórsson, Chiara Bordin
Häftad, 2025
832 kr
Biomimetic and Biohybrid Systems
Alejandro Jiménez Rodríguez, Rafael Mestre, Chaona Chen, Anna Mura, Edmund Barker, Paul Verschure, Tony Prescott
Häftad, 2025
1 010 kr
Du kanske också är intresserad av
- Nyhet
Experimental Algorithms
Vincenzo Bonifaci, Camil Demetrescu, Alberto Marchetti-Spaccamela
Häftad, 2013
550 kr
Algorithm Engineering
Gerd Stoelting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela
Häftad, 2001
565 kr
Complexity and Approximation
Giorgio Ausiello, Pierluigi Crescenzi, Giorgio Gambosi, Viggo Kann, Alberto Marchetti-Spaccamela, Marco Protasi
Häftad, 2013
767 kr
Automata, Languages and Programming
Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias, Sotiris Nikoletseas, Wolfgang Thomas
Häftad, 2009
1 085 kr
Algorithm Engineering
Alberto Marchetti-Spaccamela, Daniele Frigioni, Gerd Stoelting Brodal
734 kr
Graph-Theoretic Concepts in Computer Science
Fabrizio D'Amore, Paolo Giulio Franciosa, Alberto Marchetti-Spaccamela
Häftad, 1997
551 kr