IPL 1998 | Sciweavers

6

click to vote

IPL
1998

86views more IPL 1998»

The Bandwidth Allocation Problem in the ATM Network Model is NP-Complete

13 years 4 months ago

Download bit.csc.lsu.edu

Sundarajan Vedantham, S. Sitharama Iyengar

claim paper

Read More »

12

click to vote

IPL
1998

80views more IPL 1998»

The Economics of Large-Memory Computations

13 years 4 months ago

Download www.cs.auckland.ac.nz

We propose, and justify, an economic theory to guide memory system design, operation, and analysis. Our theory treats memory random-access latency, and its cost per installed mega...

Clark D. Thomborson

claim paper

Read More »

5

click to vote

IPL
1998

44views more IPL 1998»

Data Sufficiency for Queries on Cache

13 years 4 months ago

Download www.hpl.hp.com

Oded Shmueli, Kurt A. Shoens

claim paper

Read More »

9

click to vote

IPL
1998

68views more IPL 1998»

Fast Nondeterministic Recognition of Context-Free Languages Using two Queues

13 years 4 months ago

Download www.cs.miami.edu

We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.

Burton Rosenberg

claim paper

Read More »

7

click to vote

IPL
1998

45views more IPL 1998»

A Simplified NP-Complete MAXSAT Problem

13 years 4 months ago

Download www.ti.inf.ethz.ch

Venkatesh Raman, Bala Ravikumar, S. Srinivasa Rao

claim paper

Read More »

4

click to vote

IPL
1998

46views more IPL 1998»

An Optimal Parallel Algorithm for Sorting Multisets

13 years 4 months ago

Download www.cise.ufl.edu

Sanguthevar Rajasekaran

claim paper

Read More »

11

click to vote

IPL
1998

95views more IPL 1998»

Coloring Random Graphs

13 years 4 months ago

Download www.math.tau.ac.il

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes diﬀer by at most one. The least positive integer k for which there exis...

Michael Krivelevich, Benny Sudakov

claim paper

Read More »

8

click to vote

IPL
1998

89views more IPL 1998»

A Limitation of Vector Timestamps for Reconstructing Distributed Computations

13 years 4 months ago

Download sky.fit.qut.edu.au

Vector timestamps provide a way of recording the causal relationships between events in a distributed computation. We draw attention to a limitation of such timestamps when used t...

Colin J. Fidge

claim paper

Read More »

8

click to vote

IPL
1998

177views more IPL 1998»

A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation

13 years 4 months ago

Download islab.hoseo.ac.kr

A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...

JaeCheol Ha, Sang-Jae Moon

claim paper

Read More »

4

click to vote

IPL
1998

48views more IPL 1998»

The Homogeneous Set Sandwich Problem

13 years 4 months ago