Automata, Languages and Programming (Record no. 188010)

MARC details
000 -LEADER
fixed length control field 07707nam a22006495i 4500
001 - CONTROL NUMBER
control field 978-3-540-68681-1
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240423132448.0
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr nn 008mamaa
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 150519s1998 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540686811
-- 978-3-540-68681-1
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/BFb0055035
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.758
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM051230
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code UMZ
Source thema
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 005.1
Edition number 23
245 10 - TITLE STATEMENT
Title Automata, Languages and Programming
Medium [electronic resource] :
Remainder of title 25th International Colloquium, ICALP'98, Aalborg, Denmark July 13-17, 1998, Proceedings /
Statement of responsibility, etc edited by Kim G. Larsen, Sven Skyum, Glynn Winskel.
250 ## - EDITION STATEMENT
Edition statement 1st ed. 1998.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg :
-- Imprint: Springer,
-- 1998.
300 ## - PHYSICAL DESCRIPTION
Extent XXXII, 936 p.
Other physical details online resource.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science,
International Standard Serial Number 1611-3349 ;
Volume number/sequential designation 1443
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Algorithmic verification of linear temporal logic specifications -- On existentially first-order definable languages and their relation to NP -- An algebraic approach to communication complexity -- Deciding global partial-order properties -- Simple linear-time algorithms for minimal fixed points -- Hardness results for dynamic problems by extensions of Fredman and Saks' chronogram method -- Simpler and faster dictionaries on the AC0 RAM -- Partial-congruence factorization of bisimilarity induced by open maps -- Reset nets between decidability and undecidability -- Geometric algorithms for robotic manipulation -- Compact encodings of planar graphs via canonical orderings and multiple parentheses -- Reducing simple polygons to triangles - A proof for an improved conjecture - -- Difficult configurations — on the complexity of LTrL -- On the expressiveness of real and integer arithmetic automata -- Distributed matroid basis completion via elimination upcast and distributed correction of minimum-weight spanning trees -- Independent sets with domination constraints -- Robust asynchronous protocols are finite-state -- Deciding bisimulation-like equivalences with finite-state processes -- Do probabilistic algorithms outperform deterministic ones? -- A degree-decreasing Lemma for (MOD q, MOD p) circuits -- Improved pseudorandom generators for combinatorial rectangles -- Translation validation for synchronous languages -- An efficient and unified approach to the decidability of equivalence of propositional programs -- On branching programs with bounded uncertainty -- CONS-free programs with tree input -- Concatenable graph processes: Relating processes and derivation traces -- Axioms for contextual net processes -- Existential types: Logical relations and operational equivalence -- Optimal samplingstrategies in quicksort -- A genuinely polynomial-time algorithm for sampling two-rowed contingency tables -- A modular approach to denotational semantics -- Generalised flowcharts and games -- Efficient minimization of numerical summation errors -- Efficient approximation algorithms for the subset-sums equality problem -- Structural recursive definitions in type theory -- A good class of tree automata. Application to inductive theorem proving -- Locally periodic infinite words and a chaotic behaviour -- Bridges for concatenation hierarchies -- Complete proof systems for observation congruences in finite-control ?-calculus -- Concurrent constraints in the fusion calculus -- On computing the entropy of cellular automata -- On the determinization of weighted finite automata -- Bulk-synchronous parallel multiplication of boolean matrices -- A complex example of a simplifying rewrite system -- On a duality between Kruskal and Dershowitz theorems -- A total AC-compatible reduction ordering on higher-order terms -- Model checking game properties of multi-agent systems -- Limited wavelength conversion in all-optical tree networks -- Computing mimicking networks -- Metric semantics for true concurrent real time -- The regular real-time languages -- Static and dynamic low-congested interval routing schemes -- Low-bandwidth routing and electrical power networks -- Constraint automata and the complexity of recursive subtype entailment -- Reasoning about the past with two-way automata -- A neuroidal architecture for cognitive computation -- Deterministic polylog approximation for minimum communication spanning trees -- A polynomial time approximation scheme for euclidean minimum cost k-connectivity -- Global/local subtyping and capability inference for a distributed ?-calculus -- Checking strong/Weakbisimulation equivalences and observation congruence for the ?-calculus -- Inversion of circulant matrices over Zm -- Application of Lempel-Ziv encodings to the solution of word equations -- Explicit substitutitions for constructive necessity -- The relevance of proof-irrelevance -- New horizons in quantum information processing -- Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP -- Image density is complete for non-interactive-SZK -- Randomness spaces -- Totality, definability and boolean circuits -- Quantum counting -- On the complexity of deriving score functions from examples for problems in molecular biology -- A hierarchy of equivalences for asynchronous calculi -- On asynchrony in name-passing calculi -- Protection in programming-language translations -- Efficient simulations by queue machines -- Power of cooperation and multihead finite systems -- A simple solution to type specialization -- Multi-stage programming: axiomatization and type safety.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP'98, held in Aalborg, Denmark, in July 1998. The 70 revised full papers presented together with eight invited contributions were carefully selected from a total of 182 submissions. The book is divided in topical sections on complexitiy, verification, data structures, concurrency, computational geometry, automata and temporal logic, algorithms, infinite state systems, semantics, approximation, thorem proving, formal languages, pi-calculus, automata and BSP, rewriting, networking and routing, zero-knowledge, quantum computing, etc.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Software engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence
General subdivision Data processing.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer graphics.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer networks .
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial intelligence.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Software Engineering.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Theory of Computation.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Data Science.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Graphics.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Artificial Intelligence.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Larsen, Kim G.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Skyum, Sven.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Winskel, Glynn.
Relator term editor.
Relator code edt
-- http://id.loc.gov/vocabulary/relators/edt
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer Nature eBook
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540647812
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783662165959
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 1611-3349 ;
Volume number/sequential designation 1443
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://doi.org/10.1007/BFb0055035">https://doi.org/10.1007/BFb0055035</a>
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-SXCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks-CSE-Springer

No items available.

© 2024 IIIT-Delhi, library@iiitd.ac.in