Volume 181; Issue 2

Theoretical Computer Science

Volume 181; Issue 2
1

Foreword

Du Dingzhu, Li Ming
Journal:
Theoretical Computer Science
Year:
1997
File:
PDF, 29 KB
1997
2

No NP problems averaging over ranking of distributions are harder

Jay Belanger, Wang Jie
Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 1.14 MB
english, 1997
3

Algorithmic graph embeddings

Jianer Chen
Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 1.42 MB
english, 1997
5

Transformations that preserve malignness of universal distributions

Kojiro Kobayashi
Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 1.07 MB
english, 1997
6

Maximum tree-packing in time O(n52)

Andrzej Lingas
Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 679 KB
english, 1997
8

A 32log 3-competitive algorithm for the counterfeit coin problem

Peng-Jun Wan, Qifan Yang, Dean Kelley
Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 524 KB
english, 1997
9

Scheduling task-trees with additive scales on parallel/distributed machines

Xiangdong Yu, Moti Yung
Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 1.42 MB
english, 1997
10

Compact location problems

S.O. Krumke, M.V. Marathe, H. Noltemeier, V. Radhakrishnan, S.S. Ravi, D.J. Rosenkrantz
Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 1.69 MB
english, 1997
11

Author index volume 181 (1997)

Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 96 KB
english, 1997
12

Small weight bases for hamming codes

John Tromp, Louxin Zhang, Ying Zhao
Journal:
Theoretical Computer Science
Year:
1997
Language:
english
File:
PDF, 551 KB
english, 1997