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
[1]
Hilfe
Suche: Journal=SIAM J. Comput. AND YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounded-curvature shortest paths through a sequence of points using convex optimization
Xavier Goaoc
,
Hyo-Sil Kim
,
Sylvain Lazard
SIAM Journal on Computing
42
(2), 2013, pp. 662-684
Fast integer multiplication using modular arithmetic
Anindya De
,
Piyush P. Kurur
,
Chandan Saha
,
Ramprasad Saptharishi
SIAM Journal on Computing
42
(2), 2013, pp. 685-699
Testing and reconstruction of Lipschitz functions with applications to data privacy
Madhav Jha
,
Sofya Raskhodnikova
SIAM Journal on Computing
42
(2), 2013, pp. 700-731
Graph connectivities, network coding, and expander graphs
Hoo Yee Cheung
,
Lap Chi Lau
,
Kai Man Leung
SIAM Journal on Computing
42
(3), 2013, pp. 733-751
\mathcal{NP}
-hardness of approximately solving linear equations over reals
Subhash Khot
,
Dana Moshkovitz
SIAM Journal on Computing
42
(3), 2013, pp. 752-791
LDFS-based certifying algorithm for the minimum path cover problem on cocomparability graphs
Derek G. Corneil
,
Barnaby Dalton
,
Michel Habib
SIAM Journal on Computing
42
(3), 2013, pp. 792-807
Set covering with our eyes closed
Fabrizio Grandoni
,
Anupam Gupta
,
Stefano Leonardi
,
Pauli Miettinen
,
Piotr Sankowski
,
Mohit Singh
SIAM Journal on Computing
42
(3), 2013, pp. 808-830
Finding, minimizing, and counting weighted subgraphs
Virginia Vassilevska Williams
,
Ryan Williams
SIAM Journal on Computing
42
(3), 2013, pp. 831-854
On multiplicative
\lambda
-approximations and some geometric applications
Ilan Newman
,
Yuri Rabinovich
SIAM Journal on Computing
42
(3), 2013, pp. 855-883
Branching-time model checking of one-counter processes and timed automata
Stefan Göller
,
Markus Lohrey
SIAM Journal on Computing
42
(3), 2013, pp. 884-923
Graph homomorphisms with complex values: A dichotomy theorem
Jin-Yi Cai
,
Xi Chen
,
Pinyan Lu
SIAM Journal on Computing
42
(3), 2013, pp. 924-1029
Balls and bins: Smaller hash families and faster evaluation
L. Elisa Celis
,
Omer Reingold
,
Gil Segev
,
Udi Wieder
SIAM Journal on Computing
42
(3), 2013, pp. 1030-1050
Pseudorandom generators for combinatorial shapes
Parikshit Gopalan
,
Raghu Meka
,
Omer Reingold
,
David Zuckerman
SIAM Journal on Computing
42
(3), 2013, pp. 1051-1076
Computing the girth of a planar graph in linear time
Hsien-Chih Chang
,
Hsueh-I Lu
SIAM Journal on Computing
42
(3), 2013, pp. 1077-1094
Every property of hyperfinite graphs is testable
Ilan Newman
,
Christian Sohler
SIAM Journal on Computing
42
(3), 2013, pp. 1095-1112
Determining edge expansion and other connectivity measures of graphs of bounded genus
Viresh Patel
SIAM Journal on Computing
42
(3), 2013, pp. 1113-1131
A polynomial-time algorithm for estimating the partition function of the ferromagnetic Ising model on a regular matroid
Leslie Ann Goldberg
,
Mark Jerrum
SIAM Journal on Computing
42
(3), 2013, pp. 1132-1157
Computing shortest paths amid convex pseudodisks
Danny Z. Chen
,
John Hershberger
,
Haitao Wang
SIAM Journal on Computing
42
(3), 2013, pp. 1158-1184
Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities
Lap Chi Lau
,
Chun Kong Yung
SIAM Journal on Computing
42
(3), 2013, pp. 1185-1200
Locating regions in a sequence under density constraints
Benjamin A. Burton
,
Mathias Hiron
SIAM Journal on Computing
42
(3), 2013, pp. 1201-1215
Improving exhaustive search implies superpolynomial lower bounds
Ryan Williams
SIAM Journal on Computing
42
(3), 2013, pp. 1218-1244
An effective dichotomy for the counting constraint satisfaction problem
Martin Dyer
,
David Richerby
SIAM Journal on Computing
42
(3), 2013, pp. 1245-1274
Pseudorandom generators for polynomial threshold functions
Raghu Meka
,
David Zuckerman
SIAM Journal on Computing
42
(3), 2013, pp. 1275-1301
Local list-decoding and testing of random linear codes from high error
Swastik Kopparty
,
Shubhangi Saraf
SIAM Journal on Computing
42
(3), 2013, pp. 1302-1326
How to compress interactive communication
Boaz Barak
,
Mark Braverman
,
Xi Chen
,
Anup Rao
SIAM Journal on Computing
42
(3), 2013, pp. 1327-1363
Seiten
<
1
2
3
4
>