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=40
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on the approximation of the MAX CLIQUE problem
P. Crescenzi
,
C. Fiorini
,
R. Silvestri
Information Processing Letters
40
, 1991, pp. 1-5
Lower and upper power domain constructions commute on all cpos
Reinhold Heckmann
Information Processing Letters
40
, 1991, pp. 7-11
Complexity of the repeaters allocating problem
Nen-Fu Huang
,
Ching-Ho Huang
Information Processing Letters
40
, 1991, pp. 13-20
On ``inherently context-sensitive'' languages - An application of complexity cores
Volker Diekert
,
Ronald V. Book
Information Processing Letters
40
, 1991, pp. 21-23
A note on the space complexity of some decision problems for finite automata
Tao Jiang
,
B. Ravikumar
Information Processing Letters
40
, 1991, pp. 25-31
Parallel priority queues
Maria Cristina Pinotti
,
Geppino Pucci
Information Processing Letters
40
, 1991, pp. 33-40
A counterexample to the algorithms for determining opaque minimal forests
Thomas Shermer
Information Processing Letters
40
, 1991, pp. 41-42
The benefits of external wires in single row routing
Jean R.S. Blair
,
Errol L. Lloyd
Information Processing Letters
40
, 1991, pp. 43-49
On the dynamic maintenance of maximal points in the plane
Ravi Janardan
Information Processing Letters
40
, 1991, pp. 59-64
Modal functions for concise definition of state machines and products
Victor Yodaiken
Information Processing Letters
40
, 1991, pp. 65-72
A simple fixed point characterization of three-valued stable model semantics
S. Bonnier
,
U. Nilsson
,
T. Näslund
Information Processing Letters
40
, 1991, pp. 73-78
The parallel computation of minimum cost paths in graphs by stream contraction
V. Pan
,
J. Reif
Information Processing Letters
40
, 1991, pp. 79-83
New enumeration results about the optical orthogonal codes
Yi Xian Yang
Information Processing Letters
40
, 1991, pp. 85-87
Rudimentary reductions revisited
Eric Allender
,
Vivek Gore
Information Processing Letters
40
, 1991, pp. 89-95
A counterexample for the sufficiency of edge guards in star polygons
R.V. Subramaniyam
,
A.A. Diwan
Information Processing Letters
40
, 1991, pp. 97-99
On the complexity of the extreme points decision problem
Xiaodong Wang
Information Processing Letters
40
, 1991, pp. 101-106
Single step graph search problem
Ruay Shiung Chang
Information Processing Letters
40
, 1991, pp. 107-111
An algorithm for the computation of the Hutchinson distance
Jonathan Brandt
,
Carlos Cabrelli
,
Ursula Molter
Information Processing Letters
40
, 1991, pp. 113-117
Deferred data structure for the nearest neighbor problem
Alok Aggarwal
,
Prabhakar Raghavan
Information Processing Letters
40
, 1991, pp. 119-122
Linear time algorithms on circular-arc graphs
Wen-Lian Hsu
,
Kuo-Hui Tsai
Information Processing Letters
40
, 1991, pp. 123-129
The synchronization problem in protocol testing and its complexity
Sylvia Boyd
,
Hasan Ura
Information Processing Letters
40
, 1991, pp. 131-136
Constrained integer approximation to planar line intersection
Shashank Mehta
,
Maharaj Mukherjee
,
George Nagy
Information Processing Letters
40
, 1991, pp. 137-139
Preserving liveness: Comments on ``Safety and liveness from a methodological point of view''
Martin Abadi
,
Bowen Alpern
,
Krzysztof R. Apt
,
Nissim Francez
,
Shmuel Katz
,
Leslie Lamport
,
Fred B. Schneider
Information Processing Letters
40
, 1991, pp. 141-142
Computing the optimal IO sequences of a protocol in polynomial time
Wen-Huei Chen
,
Chuan Yi Tang
Information Processing Letters
40
, 1991, pp. 145-148
A note on restricted
H
-colouring
Richard Brewster
,
Gary MacGillivray
Information Processing Letters
40
, 1991, pp. 149-151
Seiten 1
2
3
>