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=Inf.~Process.~Lett. AND YEAR=2009
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Geometric pattern matching for point sets in the plane under similarity transformations
Dror Aiger
,
Klara Kedem
Information Processing Letters
109
(16), 2009, pp. 935-940
A tighter analysis of Piterman's Büchi determinization
Wanwei Liu
,
Ji Wang
Information Processing Letters
109
(16), 2009, pp. 941-945
Frequency of correctness versus average polynomial time
Gábor Erdélyi
,
Lane A. Hemaspaandra
,
Jörg Rothe
,
Holger Spakowski
Information Processing Letters
109
(16), 2009, pp. 946-949
Approximation of MIN COLORING by moderately exponential algorithms
Nicolas Bourgeois
,
Bruno Escoffier
,
Vangelis Th. Paschos
Information Processing Letters
109
(16), 2009, pp. 950-954
An
\Omega (n\log n)
lower bound for computing the sum of even-ranked elements
Marc Mörig
,
Dieter Rautenbach
,
Michiel Smid
,
Jan Tusch
Information Processing Letters
109
(16), 2009, pp. 955-956
Exponential-time approximation of weighted set cover
Marek Cygan
,
Łukasz Kowalik
,
Mateusz Wykurz
Information Processing Letters
109
(16), 2009, pp. 957-961
Assembling approximately optimal binary search trees efficiently using arithmetics
Jussi Kujala
Information Processing Letters
109
(16), 2009, pp. 962-966
On conditions for the liveness of weakly persistent nets
GuanJun Liu
,
ChangJun Jiang
Information Processing Letters
109
(16), 2009, pp. 967-970
Minimum size of a graph or digraph of given radius
Peter Dankelmann
,
Lutz Volkmann
Information Processing Letters
109
(16), 2009, pp. 971-973
An optimal algorithm for the maximum-density path in a tree
Bang Ye Wu
Information Processing Letters
109
(17), 2009, pp. 975-979
Approximating the Minimum Chain Completion problem
Tomás Feder
,
Heikki Mannila
,
Evimaria Terzi
Information Processing Letters
109
(17), 2009, pp. 980-985
Improved upper bounds on synchronizing nondeterministic automata
Zsolt Gazdag
,
Szabolcs Iván
,
Judit Nagy-György
Information Processing Letters
109
(17), 2009, pp. 986-990
A sufficient condition for pancyclic graphs
Kewen Zhao
,
Yue Lin
,
Ping Zhang
Information Processing Letters
109
(17), 2009, pp. 991-996
The bondage number in complete
t
-partite digraphs
Xindong Zhang
,
Juan Liu
,
Jixiang Meng
Information Processing Letters
109
(17), 2009, pp. 997-1000
Graphical models of separation logic
Ian Wehrman
,
C.A.R. Hoare
,
Peter W. O'Hearn
Information Processing Letters
109
(17), 2009, pp. 1001-1004
Bounded cost algorithms for multivalued consensus using binary consensus instances
Jialin Zhang
,
Wei Chen
Information Processing Letters
109
(17), 2009, pp. 1005-1009
Unary finite automata vs. arithmetic progressions
Anthony Widjaja To
Information Processing Letters
109
(17), 2009, pp. 1010-1014
Optimal extraction of motif patterns in 2D
Simona E. Rombo
Information Processing Letters
109
(17), 2009, pp. 1015-1020
A multiple-file write scheme for improving write performance of small files in Fast File System
Woo Hyun Ahn
,
Kyungjae Lee
,
Jaewon Oh
,
Kyungsub Min
,
Joon Sung Hong
Information Processing Letters
109
(18), 2009, pp. 1021-1026
Errata for ``Faster index for property matching''
M.T. Juan
,
J.J. Liu
,
Y.L. Wang
Information Processing Letters
109
(18), 2009, pp. 1027-1029
A simplified way of proving trade-off results for resolution
Jakob Nordstróm
Information Processing Letters
109
(18), 2009, pp. 1030-1035
An improved approximation lower bound for finding almost stable maximum matchings
Koki Hamada
,
Kazuo Iwama
,
Shuichi Miyazaki
Information Processing Letters
109
(18), 2009, pp. 1036-1040
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
B.S. Panda
,
Sajal K. Das
Information Processing Letters
109
(18), 2009, pp. 1041-1046
A strict strong coloring of trees
Mohammed Haddad
,
Hamamache Kheddouci
Information Processing Letters
109
(18), 2009, pp. 1047-1054
Time-bounded incompressibility of compressible strings and sequences
Edgar G. Daylight
,
Wouter M. Koolen
,
Paul M.B. Vitányi
Information Processing Letters
109
(18), 2009, pp. 1055-1059
Seiten
<
1
2
3
4
5
6
7
8
9
10
>