FEEDBACK Smiley face

Mathematical Foundations of Computer Science 1997 (Record no. 14364)

000 -LEADER
fixed length control field 05849nam a22005775i 4500
001 - CONTROL NUMBER
control field 978-3-540-69547-9
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170515111448.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 121227s1997 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540695479
-- 978-3-540-69547-9
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/BFb0029943
Source of number or code doi
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA75.5-76.95
072 #7 - SUBJECT CATEGORY CODE
Subject category code UY
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code UYA
Source bicssc
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM014000
Source bisacsh
072 #7 - SUBJECT CATEGORY CODE
Subject category code COM031000
Source bisacsh
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 004.0151
Edition number 23
245 10 - TITLE STATEMENT
Title Mathematical Foundations of Computer Science 1997
Medium [electronic resource] :
Remainder of title 22nd International Symposium, MFCS '97 Bratislava, Slovakia, August 25–29, 1997 Proceedings /
Statement of responsibility, etc edited by Igor Prívara, Peter Ružička.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 1997.
300 ## - PHYSICAL DESCRIPTION
Extent X, 526 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 0302-9743 ;
Volume number/sequential designation 1295
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Game semantics for programming languages -- Communication complexity -- Treewidth: Algorithmic techniques and results -- When are two rewrite systems more than none? -- Positive applications of lattices to cryptography -- A tile-based coordination view of asynchronous ?-calculus -- Communication complexity and sequential computation -- Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus -- Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds -- Learning to perform knowledge-intensive inferences -- Resolution proofs, exponential bounds, and Kolmogorov complexity -- The expressiveness of Datalog cicuits (DAC) -- The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes -- A category of transition systems and its relations with orthomodular posets -- Accepting Zeno words without making time stand still -- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams -- Specifying computations using hyper transition systems -- A shift-invariant metric on S zz inducing a non-trivial topology -- Subtyping calculus of construction (extended abstract) -- Distances between languages and reflexivity of relations -- Partial characterization of synchronization languages -- Integrating the specification techniques of graph transformation and temporal logic -- On the generation of trees by hyperedge replacement -- Regulation by valences -- Simulation as a correct transformation of rewrite systems -- On the dilation of interval routing -- Relating conflict-free stable transition and event models (extended abstract) -- The giant component threshold for random regular graphs with edge faults -- A topological generalization of propositional linear time temporal logic -- Multi-head finite automata: Data-independent versus data-dependent computations -- Complexity of finding short resolution proofs -- On P versus NP?co-NP for decision trees and read-once branching programs -- A characterization of abstract families of algebraic power series -- Repetitiveness of D0L-languages is decidable in polynomial time -- Minimal letter frequency in n-th power-free binary words -- Real-time generation of primes by a one-dimensional cellular automaton with 11 states -- Optimal algorithms for complete linkage clustering in d dimensions -- Invertible linear cellular automata over Zm: Algorithmic and dynamical aspects -- Two-level contextual grammars: The internal case -- Counting problems over the reals -- On the influence of the state encoding on OBDD-representations of finite state machines -- Decomposition of TrPTL formulas -- NP-hard sets have many hard instances -- Deciding verbose languages with linear advice -- Homomorphic images of sentential forms and terminating grammars (extended abstract) -- Simplification orders for term graph rewriting -- Dependency-based action refinement -- A hierarchy for (1, +k)-branching programs with respect to k -- Routing with finite speeds of memory and network -- Queries and algorithms computable by polynomial time existential reflective machines -- Partial order semantics and read arcs.
520 ## - SUMMARY, ETC.
Summary, etc This book constitutes the refereed proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS '97, held in Bratislava, Slovakia, in August 1997. The 40 revised full papers presented were carefully selected from a total of 94 submissions. Also included are nine invited papers and two abstracts of invited talks. The papers cover the whole range of theoretical computer science including programming theory, complexity theory, mathematical logic, rewriting, grammars, formal languages, theory of algorithms, computational graph theory, etc.
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 Software engineering.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Programming languages (Electronic computers).
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computers.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics.
650 14 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Science.
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 Programming Languages, Compilers, Interpreters.
650 24 - 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 Discrete Mathematics in Computer Science.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Prívara, Igor.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Ružička, Peter.
Relator term editor.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element SpringerLink (Online service)
773 0# - HOST ITEM ENTRY
Title Springer eBooks
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Display text Printed edition:
International Standard Book Number 9783540634379
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 1295
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/BFb0029943
912 ## -
-- ZDB-2-SCS
912 ## -
-- ZDB-2-LNC
912 ## -
-- ZDB-2-BAE
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme
Koha item type e-Book

No items available.


© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in