Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=SIAM J. Comput. AND YEAR=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time
Francis Chin
,
Cao An Wang
SIAM Journal on Computing
28
(2), 1998, pp. 471-486
Reconstructing algebraic functions from mixed data
Sigal Ar
,
Richard J. Lipton
,
Ronitt Rubinfeld
,
Madhu Sudan
SIAM Journal on Computing
28
(2), 1998, pp. 487-510
Optimal broadcast with partial knowledge
Baruch Awerbuch
,
Israel Cidon
,
Shay Kutten
,
Yishay Mansour
,
David Peleg
SIAM Journal on Computing
28
(2), 1998, pp. 511-524
Primal-dual
RNC
approximation algorithms for set cover and covering integer programs
Sridhar Rajagopalan
,
Vijay V. Vazirani
SIAM Journal on Computing
28
(2), 1998, pp. 525-540
Optimal construction of edge-disjoint paths in random graphs
Andrei Z. Broder
,
Alan M. Frieze
,
Stephen Suen
,
Eli Upfal
SIAM Journal on Computing
28
(2), 1998, pp. 541-573
Fully dynamic algorithms for bin packing: Being (mostly) myopic helps
Zoran Ivković
,
Errol L. Lloyd
SIAM Journal on Computing
28
(2), 1998, pp. 574-611
Dynamic trees and dynamic point location
Michael T. Goodrich
,
Roberto Tamassia
SIAM Journal on Computing
28
(2), 1998, pp. 612-636
Query order
Lane A. Hemaspaandra
,
Harald Hempel
,
Gerd Wechsung
SIAM Journal on Computing
28
(2), 1998, pp. 637-651
Finding the
k
shortest paths
David Eppstein
SIAM Journal on Computing
28
(2), 1998, pp. 652-673
Exact learning of discretized geometric concepts
Nader H. Bshouty
,
Paul W. Goldberg
,
Sally A. Goldman
,
H. David Mathias
SIAM Journal on Computing
28
(2), 1998, pp. 674-699
Fast exponentiation using data compression
Yacov Yacobi
SIAM Journal on Computing
28
(2), 1998, pp. 700-703
A polynomial time complexity bound for computations on curves
P.G. Walsh
SIAM Journal on Computing
28
(2), 1998, pp. 704-708
Stochastic contention resolution with short delays
Prabhakar Raghavan
,
Eli Upfal
SIAM Journal on Computing
28
(2), 1998, pp. 709-719
Asymptotically optimal election on weighted rings
Lisa Higham
,
Teresa Przytycka
SIAM Journal on Computing
28
(2), 1998, pp. 720-732
The queue-read queue-write PRAM model: Accounting for contention in parallel algorithms
Phillip B. Gibbons
,
Yossi Matias
,
Vijaya Ramachandran
SIAM Journal on Computing
28
(2), 1998, pp. 733-769
Hypercubic sorting networks
Tom Leighton
,
C. Greg Plaxton
SIAM Journal on Computing
27
(1), 1998, pp. 1-47
The shrinkage exponent of de Morgan formulas is 2
Johan Håstad
SIAM Journal on Computing
27
(1), 1998, pp. 48-64
Shared memory consistency conditions for nonsequential execution: Definitions and programming strategies
Hagit Attiya
,
Soma Chaudhuri
,
Roy Friedman
,
Jennifer L. Welch
SIAM Journal on Computing
27
(1), 1998, pp. 65-89
Two-dimensional periodicity in rectangular arrays
Amihood Amir
,
Gary Benson
SIAM Journal on Computing
27
(1), 1998, pp. 90-106
A fast discrete approximation algorithm for the Radon transform
Martin L. Brady
SIAM Journal on Computing
27
(1), 1998, pp. 107-119
Value sets of some polynomials over finite fields
GF(2^{2m})
Thomas W. Cusick
SIAM Journal on Computing
27
(1), 1998, pp. 120-131
Optimal upward planarity testing of single-source digraphs
Paola Bertolazzi
,
Giuseppe di Battista
,
Carlo Mannino
,
Roberto Tamassia
SIAM Journal on Computing
27
(1), 1998, pp. 132-169
Linear and
O(n \log n)
time minimum-cost matching algorithms for quasi-convex tours
Samuel R. Buss
,
Peter N. Yianilos
SIAM Journal on Computing
27
(1), 1998, pp. 170-201
Space-efficient scheduling of multithreaded computations
Robert D. Blumofe
,
Charles E. Leiserson
SIAM Journal on Computing
27
(1), 1998, pp. 202-229
Simulating threshold circuits by majority circuits
Mikael Goldmann
,
Marek Karpinski
SIAM Journal on Computing
27
(1), 1998, pp. 230-246
Seiten
<
1
2
3
4
5
>