FCT 2005 - PDF Preprint Papers

FCT 2005 Fundamentals of Computation Theory

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed FCT-2005 Paper

click to vote

FCT
2005
Springer

149views Applied Computing» more FCT 2005»

The Delayed k-Server Problem

13 years 9 months ago

Download www.egr.unlv.edu

Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	149	The Delayed k-Server Problem	claim
2	137	On the Black-Box Complexity of Sperner's Lemma	claim
3	136	On the Expressiveness of Asynchronous Cellular Automata	claim
4	132	The Complexity of Querying External Memory and Streaming Data	claim
5	123	On the Incompressibility of Monotone DNFs	claim
6	119	On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems	claim
7	119	A Simple and Fast Min-cut Algorithm	claim
8	119	Almost Optimal Explicit Selectors	claim
9	117	A Faster and Simpler 2-Approximation Algorithm for Block Sorting	claim
10	116	The Complexity of Semilinear Problems in Succinct Representation	claim
11	113	On Finding Acyclic Subhypergraphs	claim
12	113	Fully Incremental LCS Computation	claim
13	111	Completeness and Compactness of Quantitative Domains	claim
14	109	Path Coupling Using Stopping Times	claim
15	107	Deterministic Automata on Unranked Trees	claim
16	107	A Self-dependency Constraint in the Simply Typed Lambda Calculus	claim
17	104	Adaptive Zooming in Point Set Labeling	claim
18	100	Generic Density and Small Span Theorem	claim
19	100	On the Power of Unambiguity in Alternating Machines	claim
20	97	On Approximating Real-World Halting Problems	claim
21	96	Algorithms for Graphs Embeddable with Few Crossings Per Edge	claim
22	95	Improved Algorithms and Complexity Results for Power Domination in Graphs	claim
23	92	Bounds on the Power of Constant-Depth Quantum Circuits	claim
24	92	Leftist Grammars and the Chomsky Hierarchy	claim
25	90	A New Linearizing Restriction in the Pattern Matching Problem	claim
26	84	The Maximum Resource Bin Packing Problem	claim
27	82	Reconstructing Many Partitions Using Spectral Techniques	claim
28	82	A Type System for Computationally Secure Information Flow	claim
29	81	Exact Algorithms for Graph Homomorphisms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers