1 option
Discrete Mathematics and Theoretical Computer Science : 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. Proceedings / edited by Cristian S. Calude, Michael J. Dinneen, Vincent Vajnovszki.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 2731.
- Lecture Notes in Computer Science, 0302-9743 ; 2731
- Language:
- English
- Subjects (All):
- Computer programming.
- Algorithms.
- Data structures (Computer science).
- Coding theory.
- Information theory.
- Computers.
- Computer science--Mathematics.
- Computer science.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Coding and Information Theory.
- Theory of Computation.
- Discrete Mathematics in Computer Science.
- Local Subjects:
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Coding and Information Theory.
- Theory of Computation.
- Discrete Mathematics in Computer Science.
- Physical Description:
- 1 online resource (IX, 300 pages).
- Edition:
- First edition 2003.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
- System Details:
- text file PDF
- Contents:
- Invited Papers
- Two Philosophical Applications of Algorithmic Information Theory
- Covering and Secret Sharing with Linear Codes
- Combinatorial Problems Arising in SNP and Haplotype Analysis
- Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey
- Generating Gray Codes in O(1) Worst-Case Time per Word
- Contributed Papers
- Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems
- Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata
- On the Order Dual of a Riesz Space
- A Finite Complete Set of Equations Generating Graphs
- ECO Method and the Exhaustive Generation of Convex Polyominoes
- Regular Expressions with Timed Dominoes
- On Infinitary Rational Relations and Borel Sets
- Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems
- On Functions and Relations
- Paths Coloring Algorithms in Mesh Networks
- Finite State Strategies in One Player McNaughton Games
- On Algebraic Expressions of Series-Parallel and Fibonacci Graphs
- Boolean NP-Partitions and Projective Closure
- On Unimodality of Independence Polynomials of Some Well-Covered Trees
- A Coloring Algorithm for Finding Connected Guards in Art Galleries
- An Analysis of Quantified Linear Programs
- An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique
- On the Monotonic Computability of Semi-computable Real Numbers.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-45066-5
- 9783540450665
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.