Computing and combinatorics : 8th annual international conference, COCOON 2002, Singapore, August 2002 : proceedings /
Saved in:
| Meeting name: | COCOON (Conference (8th : 2002 : Singapore) |
|---|---|
| Imprint: | New York : Springer, 2002. |
| Description: | xiii, 606 p. : fig. ; 24 cm. |
| Language: | English |
| Series: | Lecture notes in computer science ; 2387 |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/4712760 |
Table of Contents:
- The Assembly of the Human and Mouse Genomes / Gene Myers
- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching / Sartaj Sahni
- DNA Complementarity and Paradigms of Computing / Arto Salomaa
- On Higher Arthur-Merlin Classes / Jin-Yi Cai, Denis Charles, A. Pavan and Samik Sengupta
- (2 + f(n))-SAT and Its Properties / Xiaotie Deng, C. H. Lee, Yunlei Zhao and Hong Zhu
- On the Minimal Polynomial of a Matrix / Thanh Minh Hoang and Thomas Thierauf
- Computable Real Functions of Bounded Variation and Semi-computable Real Numbers / Robert Rettinger, Xizhong Zheng and Burchard von Braunmuhl
- Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees / Hsueh-I Lu
- Coloring Algorithms on Subcubic Graphs / Harold N. Gabow and San Skulrattanakulchai
- Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs / Sun-yuan Hsieh, Chin-wen Ho, Tsan-sheng Hsu and Ming-tat Ko
- Extending the Accommodating Function / Joan Boyar, Lene M. Favrholdt, Kim S. Larsen and Morten N. Nielsen
- Inverse Parametric Sequence Alignment / Fangting Sun, David Fernandez-Baca and Wei Yu
- The Full Steiner Tree Problem in Phylogeny / Chin Lung Lu, Chuan Yi Tang and Richard Chia-Tung Lee
- Inferring a Union of Halfspaces from Examples / Tatsuya Akutsu and Sascha Ott
- Dictionary Look-Up within Small Edit Distance / Abdullah N. Arslan and Omer Egecioglu
- Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm / Tanja Lange and Arne Winterhof
- Co-orthogonal Codes / Vince Grolmusz
- Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2[superscript m]) / Nam-Yeun Kim, Won-Ho Lee and Kee-Young Yoo
- A Combinatorial Approach to Anonymous Membership Broadcast / Huaxiong Wang and Josef Pieprzyk
- Solving Constraint Satisfaction Problems with DNA Computing / Evgeny Dantsin and Alexander Wolpert
- New Architecture and Algorithms for Degradable VLSI/WSI Arrays / Wu Jigang, Heiko Schroder and Srikanthan Thambipillai
- Cluster: A Fast Tool to Identify Groups of Similar Programs / Casey Carter and Nicholas Tran
- Broadcasting in Generalized de Bruijn Digraphs / Yosuke Kikuchi, Shingo Osawa and Yukio Shibata
- On the Connected Domination Number of Random Regular Graphs / William Duckworth and Bernard Mans
- On the Number of Minimum Cuts in a Graph / L. Sunil Chandran and L. Shankar Ram
- On Crossing Numbers of 5-Regular Graphs / G. L. Chia and C. S. Gan
- Maximum Flows and Critical Vertices in AND/OR Graphs / Yvo Desmedt and Yongge Wang
- New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks / Amitava Datta and Albert Y. Zomaya
- Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model / Masataka Takamura and Yoshihide Igarashi
- Time and Energy Optimal List Ranking Algorithms on the k-Channel Broadcast Communication Model / Koji Nakano
- Energy-Efficient Size Approximation of Radio Networks with No Collision Detection / Tomasz Jurdzinski, Miroslaw Kutylowski and Jan Zatopianski
- A New Class of Symbolic Abstract Neural Nets: Tissue P Systems / C. Martin-Vide, J. Pazos, G. Paun and A. Rodriguez-Paton
- Transducers with Set Output / Jurek Czyzowicz, Wojciech Fraczak and Andrzej Pelc
- Self-assembling Finite Automata / Andreas Klein and Martin Kutrib
- Repetition Complexity of Words / Lucian Ilie, Sheng Yu and Kaizhong Zhang
- Using PageRank to Characterize Web Structure / Gopal Pandurangan, Prabhakar Raghavan and Eli Upfal
- On Randomized Broadcasting and Gossiping in Radio Networks / Ding Liu and Manoj Prabhakaran
- Fast and Dependable Communication in Hyper-rings / Tom Altman, Yoshihide Igarashi and Kazuhiro Motegi
- The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions / Gill Barequet
- Algorithms for Normal Curves and Surfaces / Marcus Schaefer, Eric Sedgwick and Daniel Stefankovic
- Terrain Polygon Decomposition, with Application to Layered Manufacturing / Ivaylo Ilinkin, Ravi Janardan and Michiel Smid
- Supertrees by Flipping / D. Chen, O. Eulenstein, D. Fernandez-Baca and M. Sanderson
- A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays / Tak-Wah Lam, Kunihiko Sadakane, Wing-Kin Sung and Siu-Ming Yiu
- Sharpening Occam's Razor / Ming Li, John Tromp and Paul Vitanyi
- Approximating 3D Points with Cylindrical Segments / Binhai Zhu
- Algorithms for the Multicolorings of Partial k-Trees / Takehiro Ito, Takao Nishizeki and Xiao Zhou
- A Fault-Tolerant Merge Sorting Algorithm / B. Ravikumar
- 2-Compromise Usability in 1-Dimensional Statistical Databases / Ljiljana Brankovic and Jozef Siran
- An Experimental Study and Comparison of Topological Peeling and Topological Walk / Danny Z. Chen, Shuang Luan and Jinhui Xu
- On-Line Maximizing the Number of Items Packed in Variable-Sized Bins / Leah Epstein and Lene M. Favrholdt
- On-Line Grid-Packing with a Single Active Grid / Satoshi Fujita
- Bend Minimization in Orthogonal Drawings Using Integer Programming / Petra Mutzel and Rene Weiskircher
- The Conditional Location of a Median Path / Biing-Feng Wang, Shan-Chyun Ku and Yong-Hsian Hsieh
- New Results on the k-Truck Problem / Weimin Ma, Yinfeng Xu, Jane You, James Liu and Kanliang Wang
- Theory of Equal-Flows in Networks / K. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar and C. Pandu Rangan
- Minimum Back-Walk-Free Latency Problem / Yaw-Ling Lin
- Counting Satisfying Assignments in 2-SAT and 3-SAT / Vilhelm Dahllof, Peter Jonsson and Magnus Wahlstrom
- On the Maximum Number of Irreducible Coverings of an n-Vertex Graph by n - 3 Cliques / Ioan Tomescu
- On Reachability in Graphs with Bounded Independence Number / Arfst Nickelsen and Till Tantau
- On Parameterized Enumeration / Henning Fernau
- Probabilistic Reversible Automata and Quantum Automata / Marats Golovkins and Maksim Kravtsev
- Quantum versus Deterministic Counter Automata / Tomohiro Yamasaki, Hirotada Kobayashi and Hiroshi Imai
- Quantum DNF Learnability Revisited / Jeffrey C. Jackson, Christino Tamon and Tomoyuki Yamakami.
