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="Czumaj, Artur"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Thorp shuffling, butterflies, and non-Markovian couplings
Artur Czumaj
,
Berthold Vöcking
Lecture Notes in Computer Science
8572
, 2014, pp. 344-355
Algebraic synchronization trees and processes
Luca Aceto
,
Arnaud Carayol
,
Zoltán Ésik
,
Anna Ingólfsdóttir
Lecture Notes in Computer Science
7392
, 2012, pp. 30-41
Unsatisfiability bounds for random CSPs from an energetic interpolation method
Dimitris Achlioptas
,
Ricardo Menchaca-Mendez
Lecture Notes in Computer Science
7391
, 2012, pp. 1-12
The NOF multiparty communication complexity of composed functions
Anil Ada
,
Arkadev Chattopadhyay
,
Omar Fawzi
,
Phuong Nguyen
Lecture Notes in Computer Science
7391
, 2012, pp. 13-24
Optimal online buffer scheduling for block devices
Anna Adamaszek
,
Artur Czumaj
,
Matthias Englert
,
Harald Räcke
Proceedings of the 44th ACM Symposium on Theory of Computing, STOC'2012 (New York, NY, USA, May 19-22, 2012)
, 2012, pp. 589-598
Streaming tree transducers
Rajeev Alur
,
Loris D'Antoni
Lecture Notes in Computer Science
7392
, 2012, pp. 42-53
Quantum strategies are better than classical in almost any XOR game
Andris Ambainis
,
Artūrs Bac̑kurs
,
Kaspars Balodis
,
Dmitrijs Kravc̑enko
,
Raitis Ozolsand Juris Smotrovs
,
Madars Virza
Lecture Notes in Computer Science
7391
, 2012, pp. 25-37
Causal graph dynamics
Pablo Arrighi
,
Gilles Dowek
Lecture Notes in Computer Science
7392
, 2012, pp. 54-66
Degree lower bounds of tower-type for approximating formulas with parity quantifiers
Albert Atserias
,
Anuj Dawar
Lecture Notes in Computer Science
7392
, 2012, pp. 67-78
Efficient submodular function maximization under linear packing constraints
Yossi Azar
,
Iftah Gamzu
Lecture Notes in Computer Science
7391
, 2012, pp. 38-50
Polynomial-time isomorphism test for groups with no Abelian normal subgroups
László Babai
,
Paolo Codenotti
,
Youming Qiao
Lecture Notes in Computer Science
7391
, 2012, pp. 51-62
Clustering under perturbation resilience
Maria Florina Balcan
,
Yingyu Liang
Lecture Notes in Computer Science
7391
, 2012, pp. 63-74
Growing half-balls: Minimizing storage and communication costs in CDNs
Reuven Bar-Yehuda
,
Erez Kantor
,
Shay Kutten
,
Dror Rawitz
Lecture Notes in Computer Science
7392
, 2012, pp. 416-427
On the locality of some NP-complete problems
Leonid Barenboim
Lecture Notes in Computer Science
7392
, 2012, pp. 403-415
Secretary problems with convex costs
Siddharth Barman
,
Seeun Umboh
,
Shuchi Chawla
,
David Malec
Lecture Notes in Computer Science
7391
, 2012, pp. 75-87
Nearly simultaneously resettable black-box zero knowledge
Joshua Baron
,
Rafail Ostrovsky
,
Ivan Visconti
Lecture Notes in Computer Science
7391
, 2012, pp. 88-99
Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity
Bruno Bauwens
Lecture Notes in Computer Science
7391
, 2012, pp. 100-108
Monadic datalog containment
Michael Benedikt
,
Pierre Bourhis
,
Pierre Senellart
Lecture Notes in Computer Science
7392
, 2012, pp. 79-91
Super-fast distributed algorithms for metric facility location
Andrew Berns
,
James Hegeman
,
Sriram V. Pemmaraju
Lecture Notes in Computer Science
7392
, 2012, pp. 428-439
On quadratic programming with a ratio objective
Aditya Bhaskara
,
Moses Charikar
,
Rajsekar Manokaran
,
Aravindan Vijayaraghavan
Lecture Notes in Computer Science
7391
, 2012, pp. 109-120
Preventing unraveling in social networks: The anchored
k
-core problem
Kshipra Bhawalkar
,
Jon Kleinberg
,
Kevin Lewi
,
Tim Roughgarden
,
Aneesh Sharma
Lecture Notes in Computer Science
7392
, 2012, pp. 440-451
A machine-independent characterization of timed languages
Mikoƚaj Bojańczyk
,
Sƚawomir Lasota
Lecture Notes in Computer Science
7392
, 2012, pp. 92-103
Regular languages of infinite trees that are Boolean combinations of open sets
Mikoƚaj Bojańczyk
,
Thomas Place
Lecture Notes in Computer Science
7392
, 2012, pp. 104-115
Toward model theory with data values
Mikoƚaj Bojańczyk
,
Thomas Place
Lecture Notes in Computer Science
7392
, 2012, pp. 116-127
De-amortizing binary search trees
Prosenjit Bose
,
Sébastien Collette
,
Rolf Fagerberg
,
Stefan Langerman
Lecture Notes in Computer Science
7391
, 2012, pp. 121-132
Seiten 1
2
3
4
5
6
7
8
>