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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Games and winning strategies
R.J.R. Back
,
J. von Wright
Information Processing Letters
53
, 1995, pp. 165-172
A polynomial bound on the number of light cycles in an undirected graph
Ashok Subramanian
Information Processing Letters
53
, 1995, pp. 173-176
Separating collections of points in Euclidean spaces
Ralph P. Boland
,
Jorge Urrutia
Information Processing Letters
53
, 1995, pp. 177-183
Training digraphs
Hsieh-Chang Tu
,
Carl H. Smith
Information Processing Letters
53
, 1995, pp. 185-192
Generalized dominators
Rajiv Gupta
Information Processing Letters
53
, 1995, pp. 193-200
Characteristic inequalities for binary trees
Roberto De Prisco
,
Giuseppe Persiano
Information Processing Letters
53
, 1995, pp. 201-207
Undecidability of ground reducibility for word rewriting systems with variables
Gregory Kucherov
,
Michaël Rusinowitch
Information Processing Letters
53
, 1995, pp. 209-215
On enclosing
k
points by a circle
Jiȓí Matous̑ek
Information Processing Letters
53
, 1995, pp. 217-221
Termination is not modular for confluent variable-preserving term rewriting systems
Enno Ohlebusch
Information Processing Letters
53
, 1995, pp. 223-228
A parallel algorithm for the minimum weighted vertex cover problem
Aristidis Likas
,
Andreas Stafylopatis
Information Processing Letters
53
, 1995, pp. 229-234
Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
Friedrich Otto
Information Processing Letters
53
, 1995, pp. 237-242
On the security of the Lucas function
Chi-Sung Laih
,
Fu-Kuan Tu
,
Wen-Chung Tai
Information Processing Letters
53
, 1995, pp. 243-247
Optimal priority assignment for aperiodic tasks with firm deadlines in fixed priority pre-emptive systems
Robert Davis
,
Alan Burns
Information Processing Letters
53
, 1995, pp. 249-254
A note on recursive properties of the de Bruijn, Kautz and FFT digraphs
M.C. Heydemann
,
D. Sotteau
Information Processing Letters
53
, 1995, pp. 255-259
An algorithm for FIFO message delivery among migrating tasks
Valmir C. Barbosa
,
Stella C.S. Porto
Information Processing Letters
53
, 1995, pp. 261-267
An efficient semantic evaluator for warped LC(1) attributed grammars
Takehiro Tokuda
,
Yoshimichi Watanabe
Information Processing Letters
53
, 1995, pp. 269-276
Topological properties of the directional hypercube
Mounir Hamdi
Information Processing Letters
53
, 1995, pp. 277-286
On the modularization theorem for logical specifications
Paulo A.S. Veloso
,
Thomas S.E. Maibaum
Information Processing Letters
53
, 1995, pp. 287-293
A pseudo-algorithmic separation of lines from pseudo-lines
William Steiger
,
Ileana Streinu
Information Processing Letters
53
, 1995, pp. 295-299
Query processing for multimedia applications on optical media
Myra Spiliopoulou
,
Yannis Cotronis
,
Michael Hatzopoulos
Information Processing Letters
53
, 1995, pp. 301-306
New statistics for demand-based software testing
J.H.R. May
,
A.D. Lunn
Information Processing Letters
53
, 1995, pp. 307-314
Decreasing the bandwidth of a transition matrix
Ioan I. Macarie
Information Processing Letters
53
, 1995, pp. 315-320
A note on the power of majority gates and modular gates
Mikael Goldmann
Information Processing Letters
53
, 1995, pp. 321-327
An experiment with the use of predicate transformers in UNITY
Rutger M. Dijkstra
Information Processing Letters
53
, 1995, pp. 329-332
On the point-to-point connection problem
Madan Natu
,
Shu-Cheng Fang
Information Processing Letters
53
, 1995, pp. 333-336
Seiten
<
1
2
3
4
5
6
7
8
9
10
>