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: Author="Kaski, Petteri"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Subset sum in the absence of concentration
Per Austrin
,
Petteri Kaski
,
Mikko Koivisto
,
Jesper Nederlof
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 48-61
Fast witness extraction using a decision oracle
Andreas Björklund
,
Petteri Kaski
,
Łukasz Kowalik
Lecture Notes in Computer Science
8737
, 2014, pp. 149-160
On the number of connected sets in bounded degree graphs
Kustaa Kangas
,
Petteri Kaski
,
Mikko Koivisto
,
Janne H. Korhonen
Lecture Notes in Computer Science
8747
, 2014, pp. 336-347
Fast monotone summation over disjoint sets
Petteri Kaski
,
Mikko Koivisto
,
Janne H. Korhonen
,
Igor S. Sergeev
Information Processing Letters
114
(5), 2014, pp. 264-267
Space-time tradeoffs for subset sum: An improved worst case algorithm
Per Austrin
,
Petteri Kaski
,
Mikko Koivisto
,
Jussi Määttä
Lecture Notes in Computer Science
7965
, 2013, pp. 45-56
Probably optimal graph motifs
Andreas Björklund
,
Petteri Kaski
,
Lukasz Kowalik
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 20-31
Counting closed trails
Andreas Björklund
,
Petteri Kaski
Information Processing Letters
113
(1-2), 2013, pp. 1-3
Kinetic Pie Delaunay graph and its applications
Mohammad Ali Abam
,
Zahed Rahmati
,
Alireza Zarei
Lecture Notes in Computer Science
7357
, 2012, pp. 48-58
Non-preemptive speed scaling
Antonios Antoniadis
,
Chien-Chung Huang
Lecture Notes in Computer Science
7357
, 2012, pp. 249-260
Do directional antennas facilitate in reducing interferences?
Rom Aschner
,
Matthew J. Katz
,
Gila Morgenstern
Lecture Notes in Computer Science
7357
, 2012, pp. 201-212
Linear time algorithm for computing a small biclique in graphs without long induced paths
Aistis Atminas
,
Vadim V. Lozin
,
Igor Razgon
Lecture Notes in Computer Science
7357
, 2012, pp. 142-152
New approximation algorithms for the unsplittable capacitated facility location problem
Babak Behsaz
,
Mohammad R. Salavatipour
,
Zoya Svitkina
Lecture Notes in Computer Science
7357
, 2012, pp. 237-248
On minimum sum of Radii and diameters clustering
Babak Behsaz
,
Mohammad R. Salavatipour
Lecture Notes in Computer Science
7357
, 2012, pp. 71-82
String indexing for patterns with wildcards
Philip Bille
,
Inge Li Grtz
,
Hjalte Wedel Vildhj
,
Sren Vind
Lecture Notes in Computer Science
7357
, 2012, pp. 283-294
A probabilistic analysis of Christofides' algorithm
Markus Bläser
,
Konstatinos Panagiotou
,
Raghavendra Rao
Lecture Notes in Computer Science
7357
, 2012, pp. 225-236
Kernel bounds for structural parameterizations of pathwidth
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
Lecture Notes in Computer Science
7357
, 2012, pp. 352-363
Connectivity oracles for planar graphs
Glencora Borradaile
,
Seth Pettie
,
Christian Wulff-Nilsen
Lecture Notes in Computer Science
7357
, 2012, pp. 316-327
Access graphs results for LRU versus FIFO under relative worst order analysis
Joan Boyar
,
Sushmita Gupta
,
Kim S. Larsen
Lecture Notes in Computer Science
7357
, 2012, pp. 328-339
A fast algorithm for permutation pattern matching based on alternating runs
Marie-Louise Bruner
,
Martin Lackner
Lecture Notes in Computer Science
7357
, 2012, pp. 261-270
Annotating simplices with a homology basis and its applications
Oleksiy Busaryev
,
Sergio Cabello
,
Chao Chen
,
Tamal K. Dey
,
Yusu Wang
Lecture Notes in Computer Science
7357
, 2012, pp. 189-200
Linear-space data structures for range minority query in arrays
Timothy M. Chan
,
Stephane Durocher
,
Matthew Skala
,
Bryan T. Wilkinson
Lecture Notes in Computer Science
7357
, 2012, pp. 295-306
Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain
Danny Z. Chen
,
Yan Gu
,
Jian Li
,
Haitao Wang
Lecture Notes in Computer Science
7357
, 2012, pp. 177-188
Reconstructing strings from substrings with quantum queries
Richard Cleve
,
Kazuo Iwama
,
François Le Gall
,
Harumichi Nishimura
,
Seiichiro Tani
,
Junichi Teruyama
,
Shigeru Yamashita
Lecture Notes in Computer Science
7357
, 2012, pp. 388-397
Deterministic parameterized connected vertex cover
Marek Cygan
Lecture Notes in Computer Science
7357
, 2012, pp. 95-106
Asynchronous rumor spreading in preferential attachment graphs
Benjamin Doerr
,
Mahmoud Fouz
,
Tobias Friedrich
Lecture Notes in Computer Science
7357
, 2012, pp. 307-315
Seiten 1
2
3
>