SIAMCOMP 1998 | Sciweavers

12

SIAMCOMP
1998

102views more SIAMCOMP 1998»

13 years 4 months ago

A language is L-printable if there is a logspace algorithm which, on input 1n, prints all members in the language of length n. Following the work of Allender and Rubinstein [SIAM J...

Lance Fortnow, Judy Goldsmith, Matthew A. Levy, St...

claim paper

Read More »

17

click to vote

SIAMCOMP
1998

114views more SIAMCOMP 1998»

Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms

13 years 4 months ago

Download www.math.tu-berlin.de

A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...

Stefan Felsner, Lorenz Wernisch

claim paper

Read More »

17

click to vote

SIAMCOMP
1998

85views more SIAMCOMP 1998»

Separator-Based Sparsification II: Edge and Vertex Connectivity

13 years 4 months ago

Download reference.kfupm.edu.sa

We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...

David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...

claim paper

Read More »

7

click to vote

SIAMCOMP
1998

93views more SIAMCOMP 1998»

Localizing a Robot with Minimum Travel

13 years 4 months ago

Download www.cim.mcgill.ca

Gregory Dudek, Kathleen Romanik, Sue Whitesides

claim paper

Read More »

18

click to vote

SIAMCOMP
1998

114views more SIAMCOMP 1998»

Universal Limit Laws for Depths in Random Trees

13 years 4 months ago

Download cg.scs.carleton.ca

Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...

Luc Devroye

claim paper

Read More »

8

click to vote

SIAMCOMP
1998

99views more SIAMCOMP 1998»

On the Power of Finite Automata with Both Nondeterministic and Probabilistic States

13 years 4 months ago

Download www.math.ias.edu

Anne Condon, Lisa Hellerstein, Samuel Pottle, Avi ...

claim paper

Read More »

18

click to vote

SIAMCOMP
1998

168views more SIAMCOMP 1998»

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

13 years 4 months ago

Download reference.kfupm.edu.sa

This paper ﬁrst presents a uniﬁed approach to design eﬃcient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...

Maw-Shang Chang

claim paper

Read More »

12

click to vote

SIAMCOMP
1998

86views more SIAMCOMP 1998»

Exact Learning of Discretized Geometric Concepts

13 years 4 months ago

Download www.csc.liv.ac.uk

We ﬁrst present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept deﬁned by the union of m axis-parallel boxes in d-...

Nader H. Bshouty, Paul W. Goldberg, Sally A. Goldm...

claim paper

Read More »

15

click to vote

SIAMCOMP
1998

125views more SIAMCOMP 1998»

Free Bits, PCPs, and Nonapproximability-Towards Tight Results

13 years 4 months ago

Download www.cse.buffalo.edu

This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...

Mihir Bellare, Oded Goldreich, Madhu Sudan

claim paper

Read More »

9

click to vote

SIAMCOMP
1998

68views more SIAMCOMP 1998»

Guaranteeing Fair Service to Persistent Dependent Tasks

13 years 4 months ago

Download people.csail.mit.edu

Amotz Bar-Noy, Alain J. Mayer, Baruch Schieber, Ma...

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers