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 Volume=103
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The cycle roommates problem: A hard case of kidney exchange
Robert W. Irving
Information Processing Letters
103
(1), 2007, pp. 1-4
Stratified institutions and elementary homomorphisms
Marc Aiguier
,
Răazvan Diaconescu
Information Processing Letters
103
(1), 2007, pp. 5-13
On Chen and Chen's new tree inclusion algorithm
Hai-Lung Cheng
,
Biing-Feng Wang
Information Processing Letters
103
(1), 2007, pp. 14-18
Approximately
n
-secting an angle
Seok Woo Kim
,
Seong-Hun Paeng
,
Hee Je Cho
Information Processing Letters
103
(1), 2007, pp. 19-23
On cellular automata over Galois rings
Hasan Akin
,
Irfan Siap
Information Processing Letters
103
(1), 2007, pp. 24-27
Approximability of identifying codes and locating-dominating codes
Jukka Suomela
Information Processing Letters
103
(1), 2007, pp. 28-33
Kolmogorov complexity of enumerating finite sets
Nikolai K. Vereshchagin
Information Processing Letters
103
(1), 2007, pp. 34-39
Faster recognition of clique-Helly and hereditary clique-Helly graphs
Min Chih Lin
,
Jayme L. Szwarcfiter
Information Processing Letters
103
(1), 2007, pp. 40-43
Erratum to ''An algorithm for computing the restriction scaffold assignment problem in computational biology''
Justin Colannino
,
Godfried Toussaint
Information Processing Letters
103
(1), 2007, pp. 44-44
Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility
Brendan Lucier
,
Tao Jiang
,
Ming Li
Information Processing Letters
103
(2), 2007, pp. 45-51
Fault-tolerant pancyclicity of augmented cubes
Wei-Wei Wang
,
Mei-Jie Ma
,
Jun-Ming Xu
Information Processing Letters
103
(2), 2007, pp. 52-56
Name-independent compact routing in trees
Kofi A. Laing
Information Processing Letters
103
(2), 2007, pp. 57-60
Approximating geodesic tree distance
Nina Amenta
,
Matthew Godwin
,
Nicolay Postarnakevich
,
Katherine St. John
Information Processing Letters
103
(2), 2007, pp. 61-65
On algorithms for construction of all irreducible partial covers
Mikhail Ju. Moshkov
Information Processing Letters
103
(2), 2007, pp. 66-70
Linear structure of bipartite permutation graphs and the longest path problem
Ryuhei Uehara
,
Gabriel Valiente
Information Processing Letters
103
(2), 2007, pp. 71-77
Q
-ary search with one lie and bi-interval queries
Wen An Liu
,
Kun Meng
,
Shu Min Xing
Information Processing Letters
103
(2), 2007, pp. 78-81
Bounds on the Fourier coefficients of the weighted sum function
Igor E. Shparlinski
Information Processing Letters
103
(3), 2007, pp. 83-87
Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
Volker Turau
Information Processing Letters
103
(3), 2007, pp. 88-93
The monadic theory of finite representations of infinite words
Anuj Dawar
,
David Janin
Information Processing Letters
103
(3), 2007, pp. 94-101
Robustness of
P
SPACE-complete sets
A. Pavan
,
Fengming Wang
Information Processing Letters
103
(3), 2007, pp. 102-104
Local and global deadlock-detection in component-based systems are
NP
-hard
Christoph Minnameier
Information Processing Letters
103
(3), 2007, pp. 105-111
All
NP
-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size
Florin Manea
,
Victor Mitrana
Information Processing Letters
103
(3), 2007, pp. 112-118
Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines
Joseph Y.-T. Leung
,
Haibing Li
,
Michael Pinedo
,
Jiawei Zhang
Information Processing Letters
103
(3), 2007, pp. 119-129
Discriminative learning can succeed where generative learning fails
Philip M. Long
,
Rocco A. Servedio
,
Hans Ulrich Simon
Information Processing Letters
103
(4), 2007, pp. 131-135
A logical approach to multicut problems
Georg Gottlob
,
Stephanie Tien Lee
Information Processing Letters
103
(4), 2007, pp. 136-141
Seiten 1
2
>