default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJCSS, Volume 67
Volume 67, Number 1, August 2003
- Hwakyung Rim, Ju-wook Jang, Sung-Chun Kim:
A simple reduction of non-uniformity in dynamic load balancing of quantized loads on hypercube multiprocessors and hiding balancing overheads. 1-25 - Shlomi Dolev
, Sergio Rajsbaum:
Stability of long-lived consensus. 26-45 - Peter Damaschke:
On parallel attribute-efficient learning. 46-62 - William I. Gasarch, Evan Golub, Clyde P. Kruskal:
Constant time parallel sorting: an empirical view. 63-91 - Edith Cohen, Haim Kaplan, Uri Zwick:
Connection caching: model and algorithms. 92-126 - Karl Meinke:
Proof theory of higher-order equations: conservativity, normal forms and term rewriting. 127-173 - Jean-Paul Allouche, Guentcho Skordev:
Remarks on permutive cellular automata. 174-182 - Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania:
Preemptive scheduling in overloaded systems. 183-197 - Abhiram G. Ranade:
Scheduling loosely connected task graphs. 198-208
Volume 67, Number 2, September 2003
- John H. Reif:
Guest Editor's Foreword. 211 - Noga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski:
Random sampling and approximation of MAX-CSPs. 212-243 - Saugata Basu:
Computing the Betti numbers of arrangements via spectral sequences. 244-262 - Steve Chien, Lars Eilstrup Rasmussen, Alistair Sinclair:
Clifford algebras and approximating the permanent. 263-290 - Mary Cryan, Martin E. Dyer:
A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant. 291-310 - Xiaotie Deng, Christos H. Papadimitriou, Shmuel Safra:
On the complexity of price equilibria. 311-324 - Sanjeev Arora, Subhash Khot:
Fitting algebraic curves to noisy data. 325-340 - Tim Roughgarden:
The price of anarchy is independent of the network topology. 341-364 - Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic:
Recognizing string graphs in NP. 365-380 - Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas:
Optimal finger search trees in the pointer machine. 381-418 - Christopher Umans:
Pseudo-random generators for all hardnesses. 419-440 - Dimitris Achlioptas, Cristopher Moore:
Almost all graphs with average degree 4 are 3-colorable. 441-471
Volume 67, Number 3, November 2003
- Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis:
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. 473-496 - Olivier Ly:
Automatic graphs and D0L-sequences of finite graphs. 497-545 - Sanjay Jain, Efim B. Kinber:
Intrinsic complexity of learning geometrical concepts from positive data. 546-607 - Christopher M. Homan, Mayur Thakur:
One-way permutations and self-witnessing languages. 608-622 - Chunguang Li, Xiaofeng Liao, Juebang Yu:
Complex-valued wavelet network. 623-632 - Aravind Srinivasan:
On the approximability of clique and related maximization problems. 633-651
Volume 67, Number 4, December 2003
- Jianer Chen, Michael R. Fellows:
Foreword from the guest editors. 653 - Marco Cesati:
The Turing way to parameterized complexity. 654-685 - Carlos Cotta, Pablo Moscato:
The k-FEATURE SET problem is W[2]-complete. 686-690 - James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon:
Solving large FPT problems on coarse-grained parallel machines. 691-706 - R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos:
Call control with k rejections. 707-722 - Jens Gramm, Rolf Niedermeier:
A fixed-parameter algorithm for minimum quartet inconsistency. 723-741 - Johann A. Makowsky, Julian Mariño:
The parametrized complexity of knot polynomials. 742-756 - Krzysztof Pietrzak:
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems. 757-771 - Peter Heusch, Stefan Porschen, Ewald Speckenmeyer:
Improving a fixed parameter tractability time bound for the shadow problem. 772-788 - Liming Cai, David W. Juedes:
On the existence of subexponential parameterized algorithms. 789-807 - Jochen Alber, Henning Fernau, Rolf Niedermeier:
Graph separators: a parameterized view. 808-832 - Jianer Chen, Iyad A. Kanj:
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms. 833-847
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 2025-12-04 01:28 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:
