Mathematical Foundations of Computer Science 2000 : (Record no. 641461)

MARC details
000 -LEADER
fixed length control field 07644cam a2200829 i 4500
001 - CONTROL NUMBER
control field ocn769770875
003 - CONTROL NUMBER IDENTIFIER
control field OCoLC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20250703161212.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m o d
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr |||||||||||
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 111229s2000 gw ou 000 0 eng d
040 ## - CATALOGING SOURCE
Original cataloging agency DKDLA
Language of cataloging eng
Description conventions pn
Transcribing agency DKDLA
Modifying agency OCLCQ
-- OCLCO
-- OCLCQ
-- UV0
-- GW5XE
-- OCLCA
-- UA@
-- AU@
-- OCLCQ
-- TFW
-- OCLCO
-- EBLCP
-- OCLCF
-- OCLCO
-- LIP
-- UAB
-- ESU
-- OCLCQ
-- BUF
-- OCLCO
-- WYU
-- OCLCQ
-- OCLCA
-- OCLCQ
-- VT2
-- UKAHL
-- OCLCO
-- OCLCQ
-- INT
-- OCLCO
-- OCLCL
-- OCLCQ
019 ## -
-- 846892840
-- 990669339
-- 1148078637
-- 1374608493
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540446125
Qualifying information (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 3540446125
Qualifying information (electronic bk.)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 3540679014
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783540679011
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9788354044611
Qualifying information (5)
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 8354044610
024 7# - OTHER STANDARD IDENTIFIER
Standard number or code 10.1007/3-540-44612-5
Source of number or code doi
024 3# - OTHER STANDARD IDENTIFIER
Standard number or code 9783540679011
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000051332664
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000051704168
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000058395158
029 1# - (OCLC)
OCLC library identifier NZ1
System control number 14993705
029 1# - (OCLC)
OCLC library identifier NZ1
System control number 15301381
029 1# - (OCLC)
OCLC library identifier DKDLA
System control number 820120-katalog:999917677005765
029 1# - (OCLC)
OCLC library identifier AU@
System control number 000060411209
035 ## - SYSTEM CONTROL NUMBER
System control number (OCoLC)769770875
Canceled/invalid control number (OCoLC)846892840
-- (OCoLC)990669339
-- (OCoLC)1148078637
-- (OCoLC)1374608493
037 ## - SOURCE OF ACQUISITION
Stock number 3540679014
Source of stock number/acquisition 00024965
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
049 ## - LOCAL HOLDINGS (OCLC)
Holding library MAIN
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Nielsen, Mogens.
9 (RLIN) 43973
245 10 - TITLE STATEMENT
Title Mathematical Foundations of Computer Science 2000 :
Remainder of title 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 September 1, 2000 Proceedings.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. Berlin ;
-- Heidelberg :
Name of publisher, distributor, etc. Springer-Verlag Berlin Heidelberg,
Date of publication, distribution, etc. 2000.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
347 ## - DIGITAL FILE CHARACTERISTICS
File type text file
Encoding format PDF
Source rda
490 1# - SERIES STATEMENT
Series statement Lecture Notes in Computer Science ;
Volume/sequential designation 1893,
International Standard Serial Number 0302-9743
520 ## - SUMMARY, ETC.
Summary, etc. This book constitutes the refereed proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000, held in Bratislava/Slovakia in August/September 2000. The 57 revised full papers presented together with eight invited papers were carefully reviewed and selected from a total of 147 submissions. The book gives an excellent overview on current research in theoretical informatics. All relevant foundational issues, from mathematical logics as well as from discrete mathematics are covered. Anybody interested in theoretical computer science or the theory of computing will benefit from this book.
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.
546 ## - LANGUAGE NOTE
Language note English.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics
Form subdivision Congresses.
9 (RLIN) 15039
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Information theory.
9 (RLIN) 392
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer graphics.
9 (RLIN) 371
650 #2 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Information Theory
9 (RLIN) 392
650 #2 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer Graphics
9 (RLIN) 371
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Informatique
General subdivision Mathématiques
Form subdivision Congrès.
9 (RLIN) 20905
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Théorie de l'information.
9 (RLIN) 26268
650 #6 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Infographie.
9 (RLIN) 19094
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element computer graphics.
Source of heading or term aat
9 (RLIN) 371
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer graphics
Source of heading or term fast
9 (RLIN) 371
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science
General subdivision Mathematics
Source of heading or term fast
9 (RLIN) 2386
650 #7 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Information theory
Source of heading or term fast
9 (RLIN) 392
655 #7 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Conference papers and proceedings
Source of term fast
9 (RLIN) 6065
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Rovan, B.
Fuller form of name (Branislav)
-- https://id.oclc.org/worldcat/entity/E39PCjv6tD38tqFw87VQb67gGb
9 (RLIN) 41045
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Print version:
International Standard Book Number 9783540679011
776 08 - ADDITIONAL PHYSICAL FORM ENTRY
Relationship information Print version:
International Standard Book Number 9783662182642
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
Uniform title Lecture notes in computer science ;
Volume number/sequential designation 1893,
International Standard Serial Number 0302-9743
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://link.springer.com/10.1007/3-540-44612-5">https://link.springer.com/10.1007/3-540-44612-5</a>
938 ## -
-- Askews and Holts Library Services
-- ASKH
-- AH29496297
938 ## -
-- ProQuest Ebook Central
-- EBLB
-- EBL3072403
936 ## - OCLC/CONSER MISCELLANEOUS DATA (OCLC); PIECE USED FOR CATALOGING (pre-AACR2) (RLIN)
OCLC control number(s) of parallel record(s) (OCLC); Piece used for cataloging, PUC (RLIN) BATCHLOAD
994 ## -
-- 92
-- ATIST
Holdings
Withdrawn status Lost status Damaged status Not for loan Collection code Home library Current library Date acquired Total Checkouts Date last seen Price effective from Koha item type
  Not Lost     eBook LNCS e-Library e-Library 28/07/2022   28/07/2022 28/07/2022 eBook

Powered by Koha