Theoretical Computer Science, Volume 326
Volume 326, Number 1-3, October 2004
- Pascal Michel: Small Turing machines and generalized busy beaver competition. 45-56
- Friedrich Eisenbrand, Fabrizio Grandoni: On the complexity of fixed parameter clique and dominating set. 57-67
- James Allen Fill, Nevin Kapur: Limiting distributions for additive functionals on Catalan trees. 69-102
- Yashar Ganjali, Mohammad Taghi Hajiaghayi: Characterization of networks supporting multi-dimensional linear interval routing schemes. 103-116
- Tomomi Matsui, Yasuko Matsui, Yoko Ono: Random generation of 2 times 2 times ... times 2 times J contingency tables. 117-135
- Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. 137-153
- Teofilo F. Gonzalez, David Serena: Complexity of pairwise shortest path routing in the grid. 155-185
- Jean-Pierre Duval, Roman Kolpakov, Gregory Kucherov, Thierry Lecroq, Arnaud Lefebvre: Linear-time computation of local periods. 229-240
- Marcia Edson, Luca Q. Zamboni: On representations of positive integers in the Fibonacci base. 241-260
- Jirí Fiala, Aleksei V. Fishkin, Fedor V. Fomin: On distance constrained labeling of disk graphs. 261-292
- Predrag R. Jelenkovic, Ana Radovanovic: Least-recently-used caching with dependent requests. 293-327
- Xun Yi: Authenticated key agreement in dynamic peer groups. 363-382
- Minming Li, Shawn L. Huang, Xiaoming Sun, Xiao Huang: Performance evaluation for energy efficient topologic control in ad hoc wireless networks. 399-408
- Qi Cheng: On the ultimate complexity of factorials. 419-429
- Stefano Leonardi, Guido Schäfer: Cross-monotonic cost sharing methods for connected facility location games. 431-442
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T201401 by the dblp team