Return to home page
Searching: Otterbein library catalog
Some OPAL libraries remain closed or are operating at reduced service levels. Materials from those libraries may not be requestable; requested items may take longer to arrive. Note that pickup procedures may differ between libraries. Please contact your library for new procedures, specific requests, or other assistance.

LEADER 00000nam  2200565Ii 4500 
001    664271777 
003    OCoLC 
005    20100922093926.0 
006    m     o  d         
007    cr bn||||auuua 
008    100916s2004    gw a    sb    101 0 eng d 
020    3540228233|q(pbk.) 
020    9783540228233|q(pbk.) 
040    YNG|beng|erda|cYNG 
049    OH1A 
090    QA76.9.M35|bS96 2004 
111 2  Symposium on Mathematical Foundations of Computer Science 
       (1972- )|n(29th :|d2004 :|cPrague, Czech Republic)|0http:/
245 10 Mathematical foundations of computer science 2004 :|b29th 
       International Symposium, MFCS 2004, Prague, Czech Republic,
       August 22-27, 2004 : proceedings /|c[edited by] Jiri Fiala,
       Vaclav Koubek, Jan Kratochvil. 
264  1 Berlin :|bSpringer,|c2004. 
300    1 online resource (xiv, 902 pages) :|billustrations. 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
340    |gmonochrome|2rdacc|0
347    text file|2rdaft|0
490 1  Lecture notes in computer science ;|v3153. 
500    Title from title screen (viewed Aug. 12, 2004). 
500    Print version originally published 2004. 
500    Electronic book available via Springer Link. 
504    Includes bibliographical references and index 
505 0  Invited Lectures -- A Case Study of Genome Evolution: From
       Continuous to Discrete Time Model -- Multicoloring: 
       Problems and Techniques -- Some Recent Progress in 
       Algorithmic Randomness -- Ubiquitous Parameterization -- 
       Invitation to Fixed-Parameter Algorithms -- PRAM-On-Chip: 
       A Quest for Not-So-Obvious Non-obviousness -- Theory and 
       Applied Computing: Observations and Anecdotes -- Boxed 
       Ambients with Communication Interfaces -- Algebraic 
       Recognizability of Languages -- Geometric Optimization and
       Unique Sink Orientations of Cubes -- Congestion Games and 
       Coordination Mechanisms -- Graph Algorithms -- Equitable 
       Colorings of Bounded Treewidth Graphs -- The Bidimensional
       Theory of Bounded-Genus Graphs -- Parallel Knock-Out 
       Schemes in Networks -- Online Algorithms for Disk Graphs -
       - Approximations -- Protein Folding in the HP Model on 
       Grid Lattices with Diagonals -- Optimization, Games, and 
       Quantified Constraint Satisfaction -- Approximating 
       Boolean Functions by OBDDs -- On Approximation Hardness of
       the Minimum 2SAT-DELETION Problem -- Graphs and Complexity
       -- Group Coloring and List Group Coloring Are?2 P -
       Complete -- Complexity Results in Graph Reconstruction -- 
       Generating Paths and Cuts in Multi-pole (Di)graphs -- 
       Packing Directed Cycles Efficiently -- Circuits -- The 
       Complexity of Membership Problems for Circuits over Sets 
       of Integers -- Some Meet-in-the-Middle Circuit Lower 
       Bounds -- The Enumerability of P Collapses P to NC -- On 
       NC1 Boolean Circuit Composition of Non-interactive Perfect
       Zero-Knowledge -- General Complexity -- All Superlinear 
       Inverse Schemes Are coNP-Hard -- The Complexity of 
       Equivalence and Isomorphism of Systems of Equations over 
       Finite Groups -- Generation Problems -- One Query 
       Reducibilities Between Partial Information Classes -- 
       Automata -- A New Dimension Sensitive Property for 
       Cellular Automata -- Captive Cellular Automata -- 
       Simulating 3D Cellular Automata with 2D Cellular Automata 
       -- Graph Exploration by a Finite Automaton -- Parametrized
       and Kolmogorov Complexity -- On Polynomially Time Bounded 
       Symmetry of Information -- Scaled Dimension and the 
       Kolmogorov Complexity of Turing-Hard Sets -- A Geometric 
       Approach to Parameterized Algorithms for Domination 
       Problems on Planar Graphs -- Polynomial Time Approximation
       Schemes and Parameterized Complexity -- Semantics -- 
       Epistemic Foundation of the Well-Founded Semantics over 
       Bilattices -- Structural Model Checking for Communicating 
       Hierarchical Machines -- Compositional Verification: 
       Decidability Issues Using Graph Substitutions -- Event 
       Structures for Resolvable Conflict -- Scheduling -- 
       Optimal Preemptive Scheduling for General Target Functions
       -- The Price of Anarchy for Polynomial Social Cost -- 
       Agent-Based Information Handling in Large Networks -- 
       Approximating Earliest Arrival Flows with Flow-Dependent 
       Transit Times -- Algebraic Theory of Languages -- A 
       Hierarchy of Irreducible Sofic Shifts -- Membership and 
       Reachability Problems for Row-Monomial Transformations -- 
       On Pseudovarieties of Semiring Homomorphisms -- An 
       Algebraic Generalization of?-Regular Languages -- Games --
       A Protocol for Serializing Unique Strategies -- A 
       Combinatorial Strongly Subexponential Strategy Improvement
       Algorithm for Mean Payoff Games -- When Can You Play 
       Positionally? -- Languages -- The Dual of Concatenation --
       Computational Aspects of Disjunctive Sequences -- 
       Decidability of Trajectory-Based Equations -- Geometry -- 
       Efficient View Point Selection for Silhouettes of Convex 
       Polyhedra -- Angles and Lengths in Reconfigurations of 
       Polygons and Polyhedra -- Improved Bounds and Schemes for 
       the Declustering Problem -- Crossing Number Is Hard for 
       Cubic Graphs -- Languages and Complexity -- A Reducibility
       for the Dot-Depth Hierarchy -- Sublogarithmic Ambiguity --
       An Elementary Proof for the Non-parametrizability of the 
       Equation xyz=zvx -- A Generalization of Repetition 
       Threshold -- Quantum Computing -- An Algorithmic Argument 
       for Nonadaptive Query Complexity Lower Bounds on Advised 
       Quantum Computation -- Universal Test for Quantum One-Way 
       Permutations -- A Common Algebraic Description for 
       Probabilistic and Quantum Computations -- XML -- 
       Extraction and Implication of Path Constraints -- Schema 
       Evolution for XML: A Consistency-Preserving Approach -- 
       Complexity of Decision Problems for Simple Regular 
506    Available to OhioLINK libraries 
520    This book constitutes the refereed proceedings of the 29th
       International Symposium on Mathematical Foundations of 
       Computer Science, MFCS 2004, held in Prague, Czech 
       Republic in August 2004. The 60 revised full papers 
       presented together with full papers or abstracts of 10 
       invited talks were carefully reviewed and selected from 
       167 submissions. The papers are organised in topical 
       sections on graph algorithms, approximation, graphs and 
       complexity, circuits, general complexity, automata, 
       parameterized and kolmogrov complexity, semantics, 
       scheduling, algebraic theory of languages, games, 
       languages, geometry, languages and complexity, quantum 
       computing, and XML. 
533    Electronic reproduction.|bColumbus, OH :|cOhioLINK,|d2008.
       |7s2008    ohun s 
538    Mode of access: World Wide Web 
650  0 Computer science|xMathematics|vCongresses.|0http:// 
655  7 Conference papers and proceedings.|2lcgft|0http:// 
700 1  Fiala, Jiří,|d1973-|0
700 1  Kratochvíl, Jan.|0
700 1  Koubek, Václav.|0
710 2  Ohio Library and Information Network.|0
710 2  LINK (Online service)|0
773 0  |tOhioLINK electronic book center|w(OCoLC)180989150. 
773 0  |tSpringerLink|w(OCoLC)43927870. 
776 08 |iPrint version:|aSymposium on Mathematical Foundations of
       Computer Science (1972- ) (29th : 2004 : Prague, Czech 
       Republic).|tMathematical foundations of computer science 
       2004.|dBerlin : Springer, 2004|z3540228233|w(DLC)  
830  0 Lecture notes in computer science ;|0
View online

If you experience difficulty accessing or navigating this content, please contact the OPAL Support Team