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=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
Daniele Micciancio
,
Panagiotis Voulgaris
SIAM Journal on Computing
42
(3), 2013, pp. 1364-1391
Perfect matchings in
O(n\log n)
time in regular bipartite graphs
Ashish Goel
,
Michael Kapralov
,
Sanjeev Khanna
SIAM Journal on Computing
42
(3), 2013, pp. 1392-1404
Efficiency improvements in constructing pseudorandom generators from one-way functions
Iftach Haitner
,
Omer Reingold
,
Salil Vadhan
SIAM Journal on Computing
42
(3), 2013, pp. 1405-1430
Fixed-parameter algorithms for maximum agreement forests
Chris Whidden
,
Robert G. Beiko
,
Norbert Zeh
SIAM Journal on Computing
42
(4), 2013, pp. 1431-1466
The all-or-nothing multicommodity flow problem
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
SIAM Journal on Computing
42
(4), 2013, pp. 1467-1493
Privately releasing conjunctions and the statistical query barrier
Anupam Gupta
,
Moritz Hardt
,
Aaron Roth
,
Jonathan Ullman
SIAM Journal on Computing
42
(4), 2013, pp. 1494-1520
On the bit-complexity of Lempel-Ziv compression
Paolo Ferragina
,
Igor Nitto
,
Rossano Venturini
SIAM Journal on Computing
42
(4), 2013, pp. 1521-1541
Multiple-source shortest paths in embedded graphs
Sergio Cabello
,
Erin W. Chambers
,
Jeff Erickson
SIAM Journal on Computing
42
(4), 2013, pp. 1542-1571
A deterministic truthful PTAS for scheduling related machines
George Christodoulou
,
Annamária Kovács
SIAM Journal on Computing
42
(4), 2013, pp. 1572-1595
Asymmetric Traveling Salesman path and directed latency problems
Zachary Friggstad
,
Mohammad R. Salavatipour
,
Zoya Svitkina
SIAM Journal on Computing
42
(4), 2013, pp. 1596-1619
The stretch factor of the Delaunay triangulation is less than 1.998
Ge Xia
SIAM Journal on Computing
42
(4), 2013, pp. 1620-1659
Soft heaps simplified
Haim Kaplan
,
Robert E. Tarjan
,
Uri Zwick
SIAM Journal on Computing
42
(4), 2013, pp. 1660-1673
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Rajesh Chitnis
,
Mohammadtaghi Hajiaghayi
,
Dániel Marx
SIAM Journal on Computing
42
(4), 2013, pp. 1674-1696
Nerves of good covers are algorithmically unrecognizable
Martin Tancer
,
Dmitry Tonkonog
SIAM Journal on Computing
42
(4), 2013, pp. 1697-1719
Robust geometric spanners
Prosenjit Bose
,
Vida Dujmović
,
Pat Morin
,
Michiel Smid
SIAM Journal on Computing
42
(4), 2013, pp. 1720-1736
Size bounds and query plans for relational joins
Albert Atserias
,
Martin Grohe
,
Dániel Marx
SIAM Journal on Computing
42
(4), 2013, pp. 1737-1767
Counting trees in a phylogenetic network is \#P-complete
Simone Linz
,
Katherine St. John
,
Charles Semple
SIAM Journal on Computing
42
(4), 2013, pp. 1768-1776
Models for the compressible web
Flavio Chierichetti
,
Ravi Kumar
,
Silvio Lattanzi
,
Alessandro Panconesi
,
Prabhakar Raghavan
SIAM Journal on Computing
42
(5), 2013, pp. 1777-1802
Adding one edge to planar graphs makes crossing number and 1-planarity hard
Sergio Cabello
,
Bojan Mohar
SIAM Journal on Computing
42
(5), 2013, pp. 1803-1829
Jaywalking your dog: Computing the Fréchet distance with shortcuts
Anne Driemel
,
Sariel Har-Peled
SIAM Journal on Computing
42
(5), 2013, pp. 1830-1866
Computing correlation between piecewise-linear functions
Pankaj K. Agarwal
,
Boris Aronov
,
Marc van Kreveld
,
Maarten Löffler
,
Rodrigo I. Silveira
SIAM Journal on Computing
42
(5), 2013, pp. 1867-1887
Restricted isometry of Fourier matrices and list decodability of random linear codes
Mahdi Cheraghchi
,
Venkatesan Guruswami
,
Ameya Velingker
SIAM Journal on Computing
42
(5), 2013, pp. 1888-1914
An algebraic theory of complexity for discrete optimization
David A. Cohen
,
Martin C. Cooper
,
Páidí Creed
,
Peter G. Jeavons
,
Stanislav Z̑ivný
SIAM Journal on Computing
42
(5), 2013, pp. 1915-1939
On the complexity of package recommendation problems
Ting Deng
,
Wenfei Fan
,
Floris Geerts
SIAM Journal on Computing
42
(5), 2013, pp. 1940-1986
Hidden symmetry subgroup problems
Thomas Decker
,
Gábor Ivanyos
,
Miklos Santha
,
Pawel Wocjan
SIAM Journal on Computing
42
(5), 2013, pp. 1987-2007
Seiten
<
1
2
3
4
>