FEEDBACK Smiley face

Mathematical Foundations of Computer Science 2000 (Record no. 14903)

000 -LEADER
fixed length control field 05843nam a22005655i 4500
001 - CONTROL NUMBER
control field 978-3-540-44612-5
003 - CONTROL NUMBER IDENTIFIER
control field DE-He213
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20170515111517.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 121227s2000 gw | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540446125
-- 978-3-540-44612-5
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-44612-5
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 2000
Medium [electronic resource] :
Remainder of title 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 – September 1, 2000 Proceedings /
Statement of responsibility, etc edited by Mogens Nielsen, Branislav Rovan.
264 #1 -
-- Berlin, Heidelberg :
-- Springer Berlin Heidelberg,
-- 2000.
300 ## - PHYSICAL DESCRIPTION
Extent 710 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 1893
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Invited Talks -- Region Analysis and a ?-Calculus with Groups -- Abstract Data Types in Computer Algebra -- What Do We Learn from Experimental Algorithmics? -- And/Or Hierarchies and Round Abstraction -- Computational Politics: Electoral Systems -- 0–1 Laws for Fragments of Existential Second-Order Logic: A Survey -- On Algorithms and Interaction -- On the Use of Duality and Geometry in Layouts for ATM Networks -- Contributed Papers -- On the Lower Bounds for One-Way Quantum Automata -- Axiomatizing Fully Complete Models for ML Polymorphic Types -- Measure Theoretic Completeness Notions for the Exponential Time Classes -- Edge-Bisection of Chordal Rings -- Equation Satisfiability and Program Satisfiability for Finite Monoids -- XML Grammars -- Simplifying Flow Networks -- Balanced k-Colorings -- A Compositional Model for Confluent Dynamic Data-Flow Networks -- Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication -- Expressiveness of Updatable Timed Automata -- Iterative Arrays with Small Time Bounds -- Embedding Fibonacci Cubes into Hypercubes with ?(2cn) Faulty Nodes -- Periodic-Like Words -- The Monadic Theory of Morphic Infinite Words and Generalizations -- Optical Routing of Uniform Instances in Tori -- Factorizing Codes and Schützenberger Conjectures -- Compositional Characterizations of ?-Terms Using Intersection Types -- Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks -- Subtractive Reductions and Complete Problems for Counting Complexity Classes -- On the Autoreducibility of Random Sequences -- Iteration Theories of Boolean Functions -- An Algorithm Constructing the Semilinear Post for 2-Dim Reset/Transfer VASS -- NP-Completeness Results and Efficient Approximations for Radiocoloring in Planar Graphs -- Explicit Fusions -- State Space Reduction Using Partial ?-Confluence -- Reducing the Number of Solutions of NP Functions -- Regular Collections of Message Sequence Charts -- Alternating and Empty Alternating Auxiliary Stack Automata -- Counter Machines: Decidable Properties and Applications to Verification Problems -- A Family of NFA’s Which Need 2n — ? Deterministic States -- Preemptive Scheduling on Dedicated Processors: Applications of Fractional Graph Coloring -- Matching Modulo Associativity and Idempotency Is NP—Complete -- On NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems -- Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization -- Formal Series over Algebras -- ?-Calculus Synthesis -- The Infinite Versions of LogSpace ? P Are Consistent with the Axioms of Set Theory -- Timed Automata with Monotonic Activities -- On a Generalization of Bi-Complement Reducible Graphs -- Automatic Graphs and Graph D0L-Systems -- Bilinear Functions and Trees over the (max, +) Semiring -- Derivability in Locally Quantified Modal Logics via Translation in Set Theory -- ?-Calculus, Structured Coalgebras, and Minimal HD-Automata -- Informative Labeling Schemes for Graphs -- Separation Results for Rebound Automata -- Unary Pushdown Automata and Auxiliary Space Lower Bounds -- Binary Decision Diagrams by Shared Rewriting -- Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL -- Why so Many Temporal Logics Climb up the Trees? -- Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems -- A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism -- On Diving in Trees Thomas Schwentick -- Abstract Syntax and Variable Binding for Linear Binders -- Regularity of Congruential Graphs -- Sublinear Ambiguity -- An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions.
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 Computer communication systems.
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 graphics.
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 Computer Communication Networks.
650 24 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Graphics.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Nielsen, Mogens.
Relator term editor.
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rovan, Branislav.
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 9783540679011
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture Notes in Computer Science,
-- 0302-9743 ;
Volume number/sequential designation 1893
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier http://dx.doi.org/10.1007/3-540-44612-5
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