default search action
8. COCOON 2002: Singapore
- Oscar H. Ibarra, Louxin Zhang:
Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings. Lecture Notes in Computer Science 2387, Springer 2002, ISBN 3-540-43996-X
Invited Lectures
- Gene Myers:
The Assembly of the Human and Mouse Genomes. 1 - Sartaj Sahni:
Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. 2 - Arto Salomaa:
DNA Complementarity and Paradigms of Computing. 3-17
Complexity Theory I
- Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta:
On Higher Arthur-Merlin Classes. 18-27 - Xiaotie Deng, Chan H. Lee, Yunlei Zhao, Hong Zhu:
(2+ f(n))-SAT and Its Properties. 28-36 - Thanh Minh Hoang, Thomas Thierauf:
On the Minimal Polynomial of a Matrix. 37-46 - Robert Rettinger, Xizhong Zheng:
Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers. 47-56
Discrete Algorithms I
- Hsueh-I Lu:
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. 57-66 - Harold N. Gabow, San Skulrattanakulchai:
Coloring Algorithms on Subcubic Graphs. 67-76 - Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko:
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. 77-86 - Joan Boyar
, Lene M. Favrholdt
Extending the Accommodating Function. 87-96
Computational Biology and Learning Theory I
- Fangting Sun, David Fernández-Baca, Wei Yu:
Inverse Parametric Sequence Alignment. 97-106 - Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee:
The Full Steiner Tree Problem in Phylogeny. 107-116 - Tatsuya Akutsu
Inferring a Union of Halfspaces from Examples. 117-126 - Abdullah N. Arslan, Ömer Egecioglu:
Dictionary Look-Up within Small Edit Distance. 127-136
Coding Theory and Cryptography
- Tanja Lange, Arne Winterhof
Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm. 137-143 - Vince Grolmusz
Co-orthogonal Codes. 144-152 - Nam-Yeun Kim, Won-Ho Lee, Kee-Young Yoo:
Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2m). 153-161 - Huaxiong Wang, Josef Pieprzyk
A Combinatorial Approach to Anonymous Membership Broadcast. 162-170
Parallel and Distributed Architectures
- Evgeny Dantsin
Solving Constraint Satisfaction Problems with DNA Computing. 171-180 - Wu Jigang, Heiko Schröder, Thambipillai Srikanthan
New Architecture and Algorithms for Degradable VLSI/WSI Arrays. 181-190 - Casey Carter, Nicholas Q. Tran:
Cluster: A Fast Tool to Identify Groups of Similar Programs. 191-199 - Yosuke Kikuchi, Shingo Osawa, Yukio Shibata:
Broadcasting in Generalized de Bruijn Digraphs. 200-209
Graph Theory
- William Duckworth, Bernard Mans
On the Connected Domination Number of Random Regular Graphs. 210-219 - L. Sunil Chandran, L. Shankar Ram:
On the Number of Minimum Cuts in a Graph. 220-229 - Gek Ling Chia, C. S. Gan:
On Crossing Numbers of 5-Regular Graphs. 230-237 - Yvo Desmedt, Yongge Wang
Maximum Flows and Critical Vertices in AND/OR Graphs. 238-248
Radio Networks
- Amitava Datta
New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks. 249-258 - Masataka Takamura, Yoshihide Igarashi:
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model. 259-268 - Koji Nakano
Time and Energy Optimal List Ranking Algorithms on the k -Channel Broadcast Communication Model. 269-278 - Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection. 279-289
Automata and Formal Languages
- Carlos Martín-Vide, Juan Pazos, Gheorghe Paun, Alfonso Rodríguez-Patón:
A New Class of Symbolic Abstract Neural Nets: Tissue P Systems. 290-299 - Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc:
Transducers with Set Output. 300-309 - Andreas Klein, Martin Kutrib
Self-Assembling Finite Automata. 310-319 - Lucian Ilie
Repetition Complexity of Words. 320-329
Internet Networks
- Gopal Pandurangan
Using PageRank to Characterize Web Structure. 330-339 - Ding Liu, Manoj Prabhakaran:
On Randomized Broadcasting and Gossiping in Radio Networks. 340-349 - Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi:
Fast and Dependable Communication in Hyper-rings. 350-359
Computational Geometry I
- Gill Barequet:
The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions. 360-369 - Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Algorithms for Normal Curves and Surfaces. 370-380 - Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid:
Terrain Polygon Decomposition, with Application to Layered Manufacturing. 381-390
Computational Biology and Learning Theory II
- Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson:
Supertrees by Flipping. 391-400 - Tak Wah Lam, Kunihiko Sadakane
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. 401-410 - Ming Li, John Tromp, Paul M. B. Vitányi
Sharpening Occam's Razor. 411-419 - Binhai Zhu:
Approximating 3D Points with Cylindrical Segments. 420-429
Discrete Algorithms II
- Takehiro Ito, Takao Nishizeki, Xiao Zhou:
Algorithms for the Multicolorings of Partial k-Trees. 430-439 - Bala Ravikumar:
A Fault-Tolerant Merge Sorting Algorithm. 440-447 - Ljiljana Brankovic
2-Compromise Usability in 1-Dimensional Statistical Databases. 448-455
Computational Geometry II
- Danny Z. Chen, Shuang Luan, Jinhui Xu:
An Experimental Study and Comparison of Topological Peeling and Topological Walk. 456-466 - Leah Epstein, Lene M. Favrholdt:
On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. 467-475 - Satoshi Fujita:
On-Line Grid-Packing with a Single Active Grid. 476-483 - Petra Mutzel
Bend Minimization in Orthogonal Drawings Using Integer Programming. 484-493
Combinatorial Optimization
- Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh:
The Conditional Location of a Median Path. 494-503 - Weimin Ma, Yin-Feng Xu, Jane You, James N. K. Liu, Kanliang Wang:
New Results on the k-Truck Problem. 504-513 - K. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan:
Theory of Equal-Flows in Networks. 514-524 - Yaw-Ling Lin:
Minimum Back-Walk-Free Latency Problem. 525-534
Complexity II
- Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström:
Counting Satisfying Assignments in 2-SAT and 3-SAT. 535-543 - Ioan Tomescu:
On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques. 544-553 - Arfst Nickelsen, Till Tantau:
On Reachability in Graphs with Bounded Independence Number. 554-563 - Henning Fernau
On Parameterized Enumeration. 564-573
Quantum Computing
- Marats Golovkins, Maksim Kravtsev:
Probabilistic Reversible Automata and Quantum Automata. 574-583 - Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai:
Quantum versus Deterministic Counter Automata. 584-594 - Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami:
Quantum DNF Learnability Revisited. 595-604
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 18:59 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: