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.
Strong equivalence of logic programs under the infinite-valued semantics
Christos Nomikos
,
Panos Rondogiannis
,
William W. Wadge
Information Processing Letters
109
(11), 2009, pp. 576-581
A polynomial algorithm for the multiple knapsack problem with divisible item sizes
Paolo Detti
Information Processing Letters
109
(11), 2009, pp. 582-584
Conditional fault Hamiltonian connectivity of the complete graph
Tung-Yang Ho
,
Yuan-Kang Shih
,
Jimmy J.M. Tan
,
Lih-Hsing Hsu
Information Processing Letters
109
(12), 2009, pp. 585-588
A note on atomicity: Boosting Test&Set to solve consensus
Damien Imbs
,
Michel Raynal
Information Processing Letters
109
(12), 2009, pp. 589-591
A note on ``The super connectivity of augmented cubes''
Meijie Ma
,
Xuegong Tan
,
Jun-Ming Xu
,
Guizhen Liu
Information Processing Letters
109
(12), 2009, pp. 592-593
On path bipancyclicity of hypercubes
Xie-Bin Chen
Information Processing Letters
109
(12), 2009, pp. 594-598
Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes
Meirun Chen
,
Xiaofeng Guo
Information Processing Letters
109
(12), 2009, pp. 599-602
A DP algorithm for minimizing makespan and total completion time on a series-batching machine
Cheng He
,
Yixun Lin
,
Jinjiang Yuan
Information Processing Letters
109
(12), 2009, pp. 603-607
A note on ``An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs''
Kangbok Lee
,
Joseph Y.-T. Leung
,
Michael L. Pinedo
Information Processing Letters
109
(12), 2009, pp. 608-610
Common knowledge does not have the Beth property
Thomas Studer
Information Processing Letters
109
(12), 2009, pp. 611-614
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm
Joanna Bauer
,
Dag Haugland
,
Di Yuan
Information Processing Letters
109
(12), 2009, pp. 615-619
An algorithm for computing simple
k
-factors
Henk Meijer
,
Yurai Núñez-Rodríguez
,
David Rappaport
Information Processing Letters
109
(12), 2009, pp. 620-625
The enumeration of permutations sortable by pop stacks in parallel
Rebecca Smith
,
Vincent Vatter
Information Processing Letters
109
(12), 2009, pp. 626-629
An algorithm for solving the longest increasing circular subsequence problem
Sebastian Deorowicz
Information Processing Letters
109
(12), 2009, pp. 630-634
The number of pessimistic guesses in generalized Mastermind
Gerold Jäger
,
Marcin Peczarski
Information Processing Letters
109
(12), 2009, pp. 635-641
A simple local 3-approximation algorithm for vertex cover
Valentin Polishchuk
,
Jukka Suomela
Information Processing Letters
109
(12), 2009, pp. 642-645
A note on generalized rank aggregation
Hadas Shachnai
,
Lisa Zhang
,
Tomomi Matsui
Information Processing Letters
109
(13), 2009, pp. 647-651
On the embedding degree of reductions of an elliptic curve
Alina Carmen Cojocaru
,
Igor E. Shparlinski
Information Processing Letters
109
(13), 2009, pp. 652-654
Super restricted edge connected Cartesian product graphs
Juan Liu
,
Xing Chen
,
Jixiang Meng
Information Processing Letters
109
(13), 2009, pp. 655-659
Fast arithmetics using Chinese remaindering
George Davida
,
Bruce Litow
,
Guangwu Xu
Information Processing Letters
109
(13), 2009, pp. 660-662
A note on stutter-invariant PLTL
Cong Tian
,
Zhenhua Duan
Information Processing Letters
109
(13), 2009, pp. 663-667
A pseudo-random network mobile automaton with linear growth
Tommaso Bolognesi
Information Processing Letters
109
(13), 2009, pp. 668-674
On the algorithmic complexity of the Mastermind game with black-peg results
Michael T. Goodrich
Information Processing Letters
109
(13), 2009, pp. 675-678
On a word avoiding near repeats
Arturo Carpi
,
Valerio D'Alonzo
Information Processing Letters
109
(13), 2009, pp. 679-682
\lambda _c
-optimally half vertex transitive graphs with regularity
k
Yingzhi Tian
,
Jixiang Meng
Information Processing Letters
109
(13), 2009, pp. 683-686
Seiten
<
1
2
3
4
5
6
7
8
9
10
>