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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Automatic proofs and counterexamples for some ortholattice identities
William McCune
Information Processing Letters
65
(6), 1998, pp. 285-291
The medians of discrete sets
A. del Lungo
,
M. Nivat
,
R. Pinzani
,
L. Sorri
Information Processing Letters
65
(6), 1998, pp. 293-299
Maximum
h
-colourable subgraph problem in balanced graphs
Elias Dahlhaus
,
Paul D. Manuel
,
Mirka Miller
Information Processing Letters
65
(6), 1998, pp. 301-303
Better approximation algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT
Gunnar Andersson
,
Lars Engebretsen
Information Processing Letters
65
(6), 1998, pp. 305-311
Timed automata and recognizability
Philippe Herrmann
Information Processing Letters
65
(6), 1998, pp. 313-318
A study on interleaving versus segmentation
Kaijung Chang
,
Yan Huat Tan
,
Yaakov Varol
,
Jiang-Hsing Chu
Information Processing Letters
65
(6), 1998, pp. 319-324
Four-state stabilizing phase clock for unidirectional rings of odd size
Shing-Tsaan Huang
,
Tzong-Jye Liu
Information Processing Letters
65
(6), 1998, pp. 325-329
A parallel algorithm for circulant tridiagonal linear systems
Yaw-Wen Chang
,
Chang-Biau Yang
Information Processing Letters
65
(6), 1998, pp. 331-337
Seiten
<
1
2
3
4
5
6
7
8
9