Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

23

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540405054, 9783540450665

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Combinatorial Problems Arising in SNP and Haplotype Analysis

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_3 ◽

2003 ◽

pp. 26-47 ◽

Author(s):

Bjarni V. Halldórsson ◽

Vineet Bafna ◽

Nathan Edwards ◽

Ross Lippert ◽

Shibu Yooseph ◽

...

Keyword(s):

Haplotype Analysis ◽

Combinatorial Problems

Download Full-text

On Infinitary Rational Relations and Borel Sets

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_12 ◽

2003 ◽

pp. 155-167 ◽

Author(s):

Olivier Finkel

Keyword(s):

Download Full-text

Listing Vertices of Simple Polyhedra Associated with Dual LI(2) Systems

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_6 ◽

2003 ◽

pp. 89-96 ◽

Author(s):

Sammani D. Abdullahi ◽

Martin E. Dyer ◽

Les G. Proll

Download Full-text

Generating Gray Codes in O(1) Worst-Case Time per Word

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_5 ◽

2003 ◽

pp. 73-88 ◽

Author(s):

Timothy Walsh

Keyword(s):

Download Full-text

Boolean NP-Partitions and Projective Closure

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_18 ◽

2003 ◽

pp. 225-236

Author(s):

Sven Kosub

Keyword(s):

Projective Closure

Download Full-text

On Functions and Relations

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_14 ◽

2003 ◽

pp. 181-192

Author(s):

André Große ◽

Harald Hempel

Download Full-text

Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_13 ◽

2003 ◽

pp. 168-180 ◽

Author(s):

Frédéric Gardi

Keyword(s):

Efficient Algorithms

Download Full-text

On Algebraic Expressions of Series-Parallel and Fibonacci Graphs

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_17 ◽

2003 ◽

pp. 215-224 ◽

Author(s):

Mark Korenblit ◽

Vadim E. Levit

Keyword(s):

Algebraic Expressions

Download Full-text

Two Philosophical Applications of Algorithmic Information Theory

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_1 ◽

2003 ◽

pp. 1-10 ◽

Author(s):

Gregory Chaitin

Keyword(s):

Information Theory ◽

Algorithmic Information Theory ◽

Algorithmic Information

Download Full-text

Finite State Strategies in One Player McNaughton Games

Discrete Mathematics and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-45066-1_16 ◽

2003 ◽

pp. 203-214 ◽

Author(s):

Bakhadyr Khoussainov

Keyword(s):

Download Full-text