The SCEAS System
Navigation Menu

Conferences in DBLP

Computing and Combinatorics (COCOON) (cocoon)
2002 (conf/cocoon/2002)

  1. Gene Myers
    The Assembly of the Human and Mouse Genomes. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:1- [Conf]
  2. Sartaj Sahni
    Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:2- [Conf]
  3. Arto Salomaa
    DNA Complementarity and Paradigms of Computing. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:3-17 [Conf]
  4. Jin-yi Cai, Denis Charles, Aduri Pavan, Samik Sengupta
    On Higher Arthur-Merlin Classes. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:18-27 [Conf]
  5. Xiaotie Deng, Chan H. Lee, Yunlei Zhao, Hong Zhu
    (2+ f(n))-SAT and Its Properties. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:28-36 [Conf]
  6. Thanh Minh Hoang, Thomas Thierauf
    On the Minimal Polynomial of a Matrix. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:37-46 [Conf]
  7. Robert Rettinger, Xizhong Zheng
    Burchard von Braunmühl, Computable Real Functions of Bounded Variation and Semi-computable Real Numbers. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:47-56 [Conf]
  8. Hsueh-I Lu
    Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:57-66 [Conf]
  9. Harold N. Gabow, San Skulrattanakulchai
    Coloring Algorithms on Subcubic Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:67-76 [Conf]
  10. Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-sheng Hsu, Ming-Tat Ko
    Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:77-86 [Conf]
  11. Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
    Extending the Accommodating Function. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:87-96 [Conf]
  12. Fangting Sun, David Fernández-Baca, Wei Yu
    Inverse Parametric Sequence Alignment. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:97-106 [Conf]
  13. Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee
    The Full Steiner Tree Problem in Phylogeny. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:107-116 [Conf]
  14. Tatsuya Akutsu, Sascha Ott
    Inferring a Union of Halfspaces from Examples. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:117-126 [Conf]
  15. Abdullah N. Arslan, Ömer Egecioglu
    Dictionary Look-Up within Small Edit Distance. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:127-136 [Conf]
  16. Tanja Lange, Arne Winterhof
    Polynomial Interpolation of the Elliptic Curve and XTR Discrete Logarithm. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:137-143 [Conf]
  17. Vince Grolmusz
    Co-orthogonal Codes. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:144-152 [Conf]
  18. Nam-Yeun Kim, Won-Ho Lee, Kee-Young Yoo
    Efficient Power-Sum Systolic Architectures for Public-Key Cryptosystems in GF(2m). [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:153-161 [Conf]
  19. Huaxiong Wang, Josef Pieprzyk
    A Combinatorial Approach to Anonymous Membership Broadcast. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:162-170 [Conf]
  20. Evgeny Dantsin, Alexander Wolpert
    Solving Constraint Satisfaction Problems with DNA Computing. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:171-180 [Conf]
  21. Wu Jigang, Heiko Schröder, Thambipillai Srikanthan
    New Architecture and Algorithms for Degradable VLSI/WSI Arrays. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:181-190 [Conf]
  22. Casey Carter, Nicholas Tran
    Cluster: A Fast Tool to Identify Groups of Similar Programs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:191-199 [Conf]
  23. Yosuke Kikuchi, Shingo Osawa, Yukio Shibata
    Broadcasting in Generalized de Bruijn Digraphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:200-209 [Conf]
  24. William Duckworth, Bernard Mans
    On the Connected Domination Number of Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:210-219 [Conf]
  25. L. Sunil Chandran, L. Shankar Ram
    On the Number of Minimum Cuts in a Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:220-229 [Conf]
  26. Gek Ling Chia, C. S. Gan
    On Crossing Numbers of 5-Regular Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:230-237 [Conf]
  27. Yvo Desmedt, Yongge Wang
    Maximum Flows and Critical Vertices in AND/OR Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:238-248 [Conf]
  28. Amitava Datta, Albert Y. Zomaya
    New Energy-Efficient Permutation Routing Protocol for Single-Hop Radio Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:249-258 [Conf]
  29. Masataka Takamura, Yoshihide Igarashi
    Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:259-268 [Conf]
  30. Koji Nakano
    Time and Energy Optimal List Ranking Algorithms on the k -Channel Broadcast Communication Model. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:269-278 [Conf]
  31. Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski
    Energy-Efficient Size Approximation of Radio Networks with No Collision Detection. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:279-289 [Conf]
  32. Carlos Martín-Vide, Juan Pazos, Gheorghe Paun, Alfonso Rodríguez-Patón
    A New Class of Symbolic Abstract Neural Nets: Tissue P Systems. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:290-299 [Conf]
  33. Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc
    Transducers with Set Output. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:300-309 [Conf]
  34. Andreas Klein, Martin Kutrib
    Self-Assembling Finite Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:310-319 [Conf]
  35. Lucian Ilie, Sheng Yu, Kaizhong Zhang
    Repetition Complexity of Words. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:320-329 [Conf]
  36. Gopal Pandurangan, Prabhakar Raghavan, Eli Upfal
    Using PageRank to Characterize Web Structure. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:330-339 [Conf]
  37. Ding Liu, Manoj Prabhakaran
    On Randomized Broadcasting and Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:340-349 [Conf]
  38. Tom Altman, Yoshihide Igarashi, Kazuhiro Motegi
    Fast and Dependable Communication in Hyper-rings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:350-359 [Conf]
  39. Gill Barequet
    The On-Line Heilbronn's Triangle Problem in Three and Four Dimensions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:360-369 [Conf]
  40. Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
    Algorithms for Normal Curves and Surfaces. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:370-380 [Conf]
  41. Ivaylo Ilinkin, Ravi Janardan, Michiel H. M. Smid
    Terrain Polygon Decomposition, with Application to Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:381-390 [Conf]
  42. D. Chen, Oliver Eulenstein, David Fernández-Baca, Michael Sanderson
    Supertrees by Flipping. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:391-400 [Conf]
  43. Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu
    A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:401-410 [Conf]
  44. Ming Li, John Tromp, Paul M. B. Vitányi
    Sharpening Occam's Razor. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:411-419 [Conf]
  45. Binhai Zhu
    Approximating 3D Points with Cylindrical Segments. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:420-429 [Conf]
  46. Takehiro Ito, Takao Nishizeki, Xiao Zhou
    Algorithms for the Multicolorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:430-439 [Conf]
  47. Bala Ravikumar
    A Fault-Tolerant Merge Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:440-447 [Conf]
  48. Ljiljana Brankovic, Jozef Sirán
    2-Compromise Usability in 1-Dimensional Statistical Databases. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:448-455 [Conf]
  49. Danny Z. Chen, Shuang Luan, Jinhui Xu
    An Experimental Study and Comparison of Topological Peeling and Topological Walk. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:456-466 [Conf]
  50. Leah Epstein, Lene M. Favrholdt
    On-Line Maximizing the Number of Items Packed in Variable-Sized Bins. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:467-475 [Conf]
  51. Satoshi Fujita
    On-Line Grid-Packing with a Single Active Grid. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:476-483 [Conf]
  52. Petra Mutzel, René Weiskircher
    Bend Minimization in Orthogonal Drawings Using Integer Programming. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:484-493 [Conf]
  53. Biing-Feng Wang, Shan-Chyun Ku, Yong-Hsian Hsieh
    The Conditional Location of a Median Path. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:494-503 [Conf]
  54. Weimin Ma, Yin-Feng Xu, Jane You, James Liu, Kanliang Wang
    New Results on the k-Truck Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:504-513 [Conf]
  55. K. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan
    Theory of Equal-Flows in Networks. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:514-524 [Conf]
  56. Yaw-Ling Lin
    Minimum Back-Walk-Free Latency Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:525-534 [Conf]
  57. Vilhelm Dahllöf, Peter Jonsson, Magnus Wahlström
    Counting Satisfying Assignments in 2-SAT and 3-SAT. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:535-543 [Conf]
  58. Ioan Tomescu
    On the Maximum Number of Irreducible Coverings of an n -Vertex Graph by n -3 Cliques. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:544-553 [Conf]
  59. Arfst Nickelsen, Till Tantau
    On Reachability in Graphs with Bounded Independence Number. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:554-563 [Conf]
  60. Henning Fernau
    On Parameterized Enumeration. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:564-573 [Conf]
  61. Marats Golovkins, Maksim Kravtsev
    Probabilistic Reversible Automata and Quantum Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:574-583 [Conf]
  62. Tomohiro Yamasaki, Hirotada Kobayashi, Hiroshi Imai
    Quantum versus Deterministic Counter Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:584-594 [Conf]
  63. Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami
    Quantum DNF Learnability Revisited. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:595-604 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002