Volume 84,
Number 1,
16 October 2002
- Elvira Mayordomo:
A Kolmogorov complexity characterization of constructive Hausdorff dimension.
1-3
- Mauricio Ayala-Rincón, Alexsandro F. da Fonseca, Haydée Werneck Poubel, José de Siqueira:
A framework to visualize equivalences between computational models of regular languages.
5-16
- Takeshi Kanda, Kokichi Sugihara:
Comparison of various trees for nearest-point search with/without the Voronoi diagram.
17-22
- Shivi Shekhar Bansal, Bijendra Vishal, Phalguni Gupta:
Near optimal Cholesky factorization on orthogonal multiprocessors.
23-30
- Jun Gu, Xiao-Dong Hu, Mu-Hong Zhang:
Algorithms for multicast connection under multi-path routing model.
31-39
- Ronald I. Greenberg, Lee Guan:
On the area of hypercube layouts.
41-46
- Yong-Jik Kim, James H. Anderson:
A space- and time-efficient local-spin spin lock.
47-55
Volume 84,
Number 2,
31 October 2002
- Juha Honkala:
The equality problem for Parikh simple algebraic power series.
57-60
- Gregory Karagiorgos, Nikolaos M. Missirlis:
Accelerated diffusion algorithms for dynamic load balancing.
61-67
- Lars Jacobsen, Kim S. Larsen, Morten N. Nielsen:
On the existence and construction of non-extreme (a, b)-trees.
69-73
- Patricia Bouyer:
A logical characterization of data languages.
75-85
- Yen-Chu Chuang, Lih-Hsing Hsu, Chung-Haw Chang:
Optimal 1-edge fault-tolerant designs for ladders.
87-92
- Anand Srinivasan, Sanjoy K. Baruah:
Deadline-based scheduling of periodic task systems on multiprocessors.
93-98
- Yingyu Wan, Guoliang Chen, Yinlong Xu:
A note on the minimum label spanning tree.
99-101
- Guo-Hui Lin, Guoliang Xue:
On the terminal Steiner tree problem.
103-107
- Oh-Heum Kwon:
Scheduling time-constrained multicast messages in circuit-switched tree networks.
109-116
Volume 84,
Number 3,
15 November 2002
- Eli Biham:
How to decrypt or even substitute DES-encrypted messages in 228 steps.
117-124
- Seung Mo Cho, Hyung-Ho Kim, Sung Deok Cha, Doo-Hwan Bae:
A semantics of sequence diagrams.
125-130
- Guillaume Fertin, Emmanuel Godard, André Raspaud:
Minimum feedback vertex set and acyclic coloring.
131-139
- Zhi-Zhong Chen, Shiqing Zhang:
Tight upper bound on the number of edges in a bipartite K3, 3-free or K5-free graph with an application.
141-145
- Hans Kleine Büning, Xishun Zhao:
Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
147-151
- Oded Regev:
Priority algorithms for makespan minimization in the subset model.
153-157
- Roberto Baldoni, Giovanna Melideo:
On the minimal information to encode timestamps in distributed computations.
159-166
- Shin-Ichi Nakano:
Efficient generation of plane trees.
167-172
- Tom Araki, Yukio Shibata:
Erratum to "Pancyclicity of recursive circulant graphs": [Information Processing Letters 81 (2002) 187-190].
173
Volume 84,
Number 4,
30 November 2002
- Alberto Caprara, Romeo Rizzi:
Packing triangles in bounded degree graphs.
175-180
- Jakub Neumann, Andrzej Szepietowski, Igor Walukiewicz:
Complexity of weak acceptance conditions in tree automata.
181-187
- Kazuhisa Makino, Takashi Takabatake, Satoru Fujishige:
A simple matching algorithm for regular bipartite graphs.
189-193
- Yin-Te Tsai, Yaw-Ling Lin, Fang-Rong Hsu:
The on-line first-fit algorithm for radio frequency assignment problems.
195-199
- Sunil Arya:
Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
201-206
- Enno Ohlebusch:
Hierarchical termination revisited.
207-214
- Samir Khuller, An Zhu:
The General Steiner Tree-Star problem.
215-220
- Minyoung Sung, Soyoung Kim, Sangsoo Park, Naehyuck Chang, Heonshik Shin:
Comparative performance evaluation of Java threads for embedded applications: Linux Thread vs. Green Thread.
221-225
- Rakesh M. Verma:
Algorithms and reductions for rewriting problems II.
227-233
Volume 84,
Number 5,
16 December 2002
- Oliver Pretzel:
Characterization of simple edge-firing games.
235-236
- Adi Rosén:
A note on models for non-probabilistic analysis of packet switching networks.
237-240
- Stefania Costantini, Ottavio M. D'Antona, Alessandro Provetti:
On the equivalence and range of applicability of graph-based representations of logic programs.
241-249
- Andreas Brandstädt, Suhail Mahfud:
Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
251-259
- Ken-etsu Fujita:
An interpretation of [lambda][mu]-calculus in [lambda]-calculus.
261-264
- Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham:
New bounds on a hypercube coloring problem.
265-269
- Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan:
More on random walks, electrical networks, and the harmonic k-server algorithm.
271-276
- Hsun-Jung Cho, Li-Yen Hsu:
Ring embedding in faulty honeycomb rectangular torus.
277-284
- Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli:
Approximating minimum cocolorings.
285-290
Volume 84,
Number 6,
31 December 2002
- Daniel Kirsten:
The finite power problem revisited.
291-294
- Prasanta K. Jana, B. Damodara Naidu, Shailendra Kumar, Manish Arora, Bhabani P. Sinha:
Parallel prefix computation on extended multi-mesh network.
295-303
- Andrea Maggiolo-Schettini, Simone Tini:
On disjunction of literals in triggers of statecharts transitions.
305-310
- Antoni Diller:
Efficient multi-variate abstraction using an array representation for combinators.
311-317
- Carlo Blundo, Stelvio Cimato, Barbara Masucci:
A note on optimal metering schemes.
319-326
- A. L. Rastsvetaev, Lev D. Beklemishev:
On the query complexity of finding a local maximum point.
327-332
- Sean Cleary:
Restricted rotation distance between binary trees.
333-338
- Michael Domaratzki, Giovanni Pighizzini, Jeffrey Shallit:
Simulating finite automata with context-free grammars.
339-344
Last update Mon Feb 13 04:50:41 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
