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=Theor.~Comput.~Sci. AND YEAR=2007
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity results on branching-time pushdown model checking
Laura Bozzelli
Theoretical Computer Science
379
(1-2), 2007, pp. 286-297
Degree distribution of the FKP network model
Noam Berger
,
Béla Bollobás
,
Christian Borgs
,
Jennifer Chayes
,
Oliver Riordan
Theoretical Computer Science
379
(3), 2007, pp. 306-316
Polynomial time algorithm for an optimal stable assignment with multiple partners
Vipul Bansal
,
Aseem Agrawal
,
Varun S. Malhotra
Theoretical Computer Science
379
(3), 2007, pp. 317-328
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
Jens Jägersküpper
Theoretical Computer Science
379
(3), 2007, pp. 329-347
Decoding interleaved Reed-Solomon codes over noisy channels
Daniel Bleichenbacher
,
Aggelos Kiayias
,
Moti Yung
Theoretical Computer Science
379
(3), 2007, pp. 348-360
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
Leonid Khachiyan
,
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Theoretical Computer Science
379
(3), 2007, pp. 361-376
Generating labeled planar graphs uniformly at random
Manuel Bodirsky
,
Clemens Gröpl
,
Mihyun Kang
Theoretical Computer Science
379
(3), 2007, pp. 377-386
Multicommodity flows over time: Efficient algorithms and complexity
Alex Hall
,
Steffen Hippler
,
Martin Skutella
Theoretical Computer Science
379
(3), 2007, pp. 387-404
The cell probe complexity of succinct data structures
Anna Gál
,
Peter Bro Miltersen
Theoretical Computer Science
379
(3), 2007, pp. 405-417
Efficient pebbling for list traversal synopses with application to program rollback
Yossi Matias
,
Ely Porat
Theoretical Computer Science
379
(3), 2007, pp. 418-436
Erratum to ''Accepting networks of splicing processors: Complexity results''
Florin Manea
,
Carlos Martin-Vide
,
Victor Mitrana
Theoretical Computer Science
378
(1), 2007, pp. 131
On codes defined by bio-operations
Mark Daley
,
Michael Domaratzki
Theoretical Computer Science
378
(1), 2007, pp. 3-16
Arithmetic computation in the tile assembly model: Addition and multiplication
Yuriy Brun
Theoretical Computer Science
378
(1), 2007, pp. 17-31
Improved algorithms for quantum identification of Boolean oracles
Andris Ambainis
,
Kazuo Iwama
,
Akinori Kawachi
,
Rudy Raymond
,
Shigeru Yamashita
Theoretical Computer Science
378
(1), 2007, pp. 41-53
Statistical zero knowledge and quantum one-way functions
Elham Kashefi
,
Iordanis Kerenidis
Theoretical Computer Science
378
(1), 2007, pp. 101-116
P
systems with minimal parallelism
Gabriel Ciobanu
,
Linqiang Pan
,
Gheorghe Păun
,
Mario J. Pérez-Jiménez
Theoretical Computer Science
378
(1), 2007, pp. 117-130
A primal-dual algorithm for computing Fisher equilibrium in the absence of Gross substitutability property
Dinesh Garg
,
Kamal Jain
,
Kunal Talwar
,
Vijay V. Vazirani
Theoretical Computer Science
378
(2), 2007, pp. 143-152
An auction-based market equilibrium algorithm for a production model
Sanjiv Kapoor
,
Aranyak Mehta
,
Vijay Vazirani
Theoretical Computer Science
378
(2), 2007, pp. 153-164
On the structure and complexity of worst-case equilibria
Simon Fischer
,
Berthold Vöcking
Theoretical Computer Science
378
(2), 2007, pp. 165-174
Subjective-cost policy routing
Joan Feigenbaum
,
David R. Karger
,
Vahab S. Mirrokni
,
Rahul Sami
Theoretical Computer Science
378
(2), 2007, pp. 175-189
A new algorithm based on copulas for VaR valuation with empirical calculations
Gang Cheng
,
Ping Li
,
Peng Shi
Theoretical Computer Science
378
(2), 2007, pp. 190-197
Counting distinct items over update streams
Sumit Ganguly
Theoretical Computer Science
378
(3), 2007, pp. 211-222
Longest increasing subsequences in windows based on canonical antichain partition
Erdong Chen
,
Linji Yang
,
Hao Yuan
Theoretical Computer Science
378
(3), 2007, pp. 223-236
Efficient algorithms for center problems in cactus networks
Boaz Ben-Moshe
,
Binay Bhattacharya
,
Qiaosheng Shi
,
Arie Tamir
Theoretical Computer Science
378
(3), 2007, pp. 237-252
Decision-making based on approximate and smoothed Pareto curves
Heiner Ackermann
,
Alantha Newman
,
Heiko Röglin
,
Berthold Vöcking
Theoretical Computer Science
378
(3), 2007, pp. 253-270
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>