Abstract is missing.
- The Complexity of Mean Payoff GamesUri Zwick, Mike Paterson. 1-10
- Approximation of coNP Sets by NP-complete SetsKazuo Iwama, Shuichi Miyazaki. 11-20
- How to Draw a Planar Clustered GraphQing-Wen Feng, Robert F. Cohen, Peter Eades. 21-30
- An Efficient Orthogonal Grid Drawing Algorithm For Cubic GraphsTiziana Calamoneri, Rossella Petreschi. 31-40
- Constrained Independence System and Triangulations of Planar Point SetsSiu-Wing Cheng, Yin-Feng Xu. 41-50
- Three Dimensional Weak Visibility: Complexity and ApplicationsCao An Wang, Binhai Zhu. 51-60
- Rectangulating Rectilinear Polygons in ParallelSung Kwon Kim. 61-70
- Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary TreesV. Kamakoti, Kamala Krithivasan, C. Pandu Rangan. 71-80
- Testing Containment of Object-Oriented Conjunctive Queries is Pi_2^p-hardEdward P. F. Chan, Ron van der Meyden. 81-90
- Computing Infinite Relations Using Finite Expressions: A New Approach To The Safety Issue In Relational DatabasesRuogu Zhang. 91-100
- Set-Term Unification in a Logic Database LanguageSeung Jin Lim, Yiu-Kai Ng. 101-110
- Computations with Finite Closure Systems and ImplicationsMarcel Wild. 111-120
- Maximum Tree-Packing in Time O(n:::5/2:::)Andrzej Lingas. 121-130
- Optimal Algorithms for Finding Connected Components of an Unknown GraphWeiping Shi, Douglas B. West. 131-140
- The Multi-Weighted Spanning Tree Problem (Extended Abstract)Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe. 141-150
- Algorithmic Graph Embeddings (Extended Abstract)Jianer Chen. 151-160
- Analysis of Quorum-Based Protocols for Distributed (k+1)-ExclusionDivyakant Agrawal, Ömer Egecioglu, Amr El Abbadi. 161-170
- A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated DataXuemin Lin, Maria E. Orlowska. 171-180
- Constructing Craig Interpolation FormulasGuoxiang Huang. 181-190
- Currying of Order-Sorted Term Rewriting SystemsYoshinobu Kawabe, Naohiro Ishii. 191-202
- Stack and Queue Number of 2-TreesS. Rengarajan, C. E. Veni Madhavan. 203-212
- Shortest Paths in Random Weighted GraphsScott K. Walley, Harry H. Tan. 213-222
- Simple Reduction of f-Colorings to Edge-ColoringsXiao Zhou, Takao Nishizeki. 223-228
- Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set ProblemKazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani. 229-234
- Small Weight Bases for Hamming CodesJohn Tromp, Louxin Zhang, Ying Zhao. 235-243
- Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract)Julien Cassaigne, Juhani Karhumäki. 244-253
- A Construction for Enumerating k-coloured Motzkin PathsElena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani. 254-263
- On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems (Extended Abstract)Vladimir A. Oleshchuk. 264-269
- Extending the Hong-Kung Model to Memory HierarchiesJohn E. Savage. 270-281
- On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract)Liming Cai, Jianer Chen. 282-291
- New Bound for Afine Resolvable Designs and Its Application to Authentication CodesKaoru Kurosawa, Sanpei Kageyama. 292-302
- Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5Boris D. Lubachevsky, Ronald L. Graham. 303-312
- Efficient Parallel Algorithms for some Tree Layout ProblemsJosep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán. 313-323
- Conservative Algorithms for Parallel and Sequential Integer SortingYijie Han, Xiaojun Shen. 324-333
- An Optimal Algorithm for Proper Learning of Unions of Two Rectangles with QueriesZhixiang Chen. 334-343
- Disjunctions of Negated Counting Functions Are Efficiently Learnable with Equivalence QueriesZhixiang Chen. 344-349
- Non-empty Cross-3-Intersection Theorems of SubsetsShiquan Wu. 350-356
- Convexity of Minimal Total Dominating Functions in GraphsBo Yu. 357-365
- Transformations for Maximal Planar Graphs with Minimum Degree FiveJean Hardouin Duparc, Philippe Rolland. 366-371
- An Asynchrolous Parallel Method for Linaer SystemsYou Zhaoyong, Wang Chuanglong. 372-378
- On a Kind of Sequence of PolynomialsZhang Xiangde. 379-383
- Hamiltonian Cycles in 2-generated Cayley Digraphs of Abelian GroupsJixiang Meng. 384-387
- Pandiagonal Magic SquaresCheng-Xu Xu, Zhun-Wei Lu. 388-391
- PFFM and Quasi-Morishima MatricesHua Wang, Zhao-yong You. 392-395
- Edge-Face Total Chromatic Number of Outerplanar Graphs with Delta(G)=6C. F. Chang, J. X. Chang, X. C. Lu, Peter Che Bor Lam, J. F. Wang. 396-399
- Sets Computable in Polynomial Time on AverageRainer Schuler, Tomoyuki Yamakami. 400-409
- Rankable Distributions Do Not Provide Harder Instances Than Uniform DistributionsJay Belanger, Jie Wang. 410-419
- Transformations that Preserve Maligness of Universal DistributionsKojiro Kabayashi. 420-429
- Intersection Suffices for Boolean Hierarchy EquivalenceLane A. Hemaspaandra, Jörg Rothe. 430-435
- A 3/2 log3-Competive Algorithm for the Counterfeit Cain ProblemDean Kelley, Peng-Jun Wan, Quifan Yang. 436-445
- Searching Rigid Data Structures (Extended Abstract)Svante Carlsson, Jingsen Chen. 446-451
- A Better Subgraph of the Minimum Weight TriangulationBo-Ting Yang. 452-455
- Sequence Decomposition Method for Computing a Gröbner Basis and Its Application to Bivariate SplineWen Gao, Baocai Yin. 456-461
- A Broadcasting Algorithm on the Arrangement GraphLeqiang Bai, Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakando. 462-471
- A Fast Maximum Finding Algorithm on Broadcast CommunicationShyue-Horng Shiau, Chang-Biau Yang. 472-481
- Broadcasting in General Networks I: TreesAditya Shastri. 482-489
- Uni-directional Alternating Group GraphsShyh-Chain Chern, Tai-Ching Tuan, Jung-Sing Jwo. 490-495
- On Separating Proofs of Knowledge from Proofs of Membership of Languages and Its Application to Secure Identification Schemes (Extended Abstract)Kouichi Sakurai. 496-509
- Compact Location Problems with Budget and Communication ConstraintsSven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe. 510-519
- Minimum Dominating Sets of Intervals on Lines (Extended Abstract)Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks. 520-529
- Two-Dimensional Pattern Matching on a Dynamic Library of TextsYing Choi, Tak Wah Lam. 530-538
- Structure in Approximation Classes (Extended Abstract)Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan. 539-548
- Improved Lower Bounds for the Randomized Boppana-Halldórsson Algorithm for MAXCLIQUEMarcus Peinado. 549-558
- MNP: A Class of NP Optimization Problems (Extended Abstract)Qi Cheng, Hong Zhu. 559-565
- Semidefinite Programming and its Applications to NP ProblemsRoman Bacik, Sanjeev Mahajan. 566-575
- Analysis and Experimentation on List Update AlgorithmsLucas Chi Kwong Hui, Kwok-Yan Lam. 576-581
- An Exact Branch and Bound Algorithm for the Steiner Problem in GraphsB. N. Khoury, Panos M. Pardalos. 582-590
- A Physical Model for the Satisfiability ProblemHuang Wenqui, Li Wei, Lu Weifeng, Zhang Yuping. 591-596
- An Efficient Algorithm for Local Testability Problem of Finite State AutomataSam M. Kim, Robert McNaughton. 597-606
- Scheduling Task-Tree with Additive Scales on Parallel / Distributed MachinesXiangdong Yu, Moti Yung. 607-616
- Single-vehicle Scheduling Problem on a Straight Line with Time Window ConstraintsChi-lok Chan, Gilbert H. Young. 617-626
- An On-Line Algorithm for Some Uniform Processor SchedulingRongheng Li, Lijie Shi. 627-632
- An Algebraic Characterization of Tractable ConstraintsPeter Jeavons, David A. Cohen. 633-642
- Limit Property of Unbalanced Development in Economic NetworkJiyu Ding, Chngxiang Qing, Guodong Song. 643-646
- Document Processing, Theory, and Practice (Abstract)Derick Wood. 647
- Matching and Comparing Sequences in Molecular Biology (Abstract)Tao Jiang. 648-649
- Primal-Dual Schema Based Approximation Algorithms (Abstract)Vijay V. Vazirani. 650-652