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=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constrained visibility representations of graphs
Giuseppe Di Battista
,
Roberto Tamassia
,
Ioannis G. Tollis
Information Processing Letters
41
, 1992, pp. 1-7
A model of reconfiguration in communicating sequential processes with a notion of transactions
Jeremy Jacob
Information Processing Letters
41
, 1992, pp. 9-12
Optimization of LR(
k
) ``reduced parsers''
Massimo Ancona
,
Claudia Fassino
,
Vittoria Gianuzzi
Information Processing Letters
41
, 1992, pp. 13-20
Generating binary trees at random
M.D. Atkinson
,
J.-R. Sack
Information Processing Letters
41
, 1992, pp. 21-23
Place/transition nets with debit arcs
P. David Stotts
,
Parke Godfrey
Information Processing Letters
41
, 1992, pp. 25-33
A simple proof of a completeness result for leads-to in the UNITY logic
Jan Pachl
Information Processing Letters
41
, 1992, pp. 35-38
Breadth-first traversal of trees and integer sorting in parallel
Calvin C.-Y. Chen
,
Sajal K. Das
Information Processing Letters
41
, 1992, pp. 39-49
Another distributed algorithm for multiple entries to a critical section
Pradip K. Srimani
,
Rachamallu L.N. Reddy
Information Processing Letters
41
, 1992, pp. 51-57
Order of state functions and logic functions
Youichi Kobuchi
Information Processing Letters
41
, 1992, pp. 61-66
On efficient implementation of LR-attributed grammars
Petr Pavlů
Information Processing Letters
41
, 1992, pp. 67-75
On immunity against Biham and Shamir's ``differential cryptanalysis''
Carlisle M. Adams
Information Processing Letters
41
, 1992, pp. 77-80
Processor-efficient exponentiation in finite fields
Joachim von zur Gathen
Information Processing Letters
41
, 1992, pp. 81-86
A recursive ascent Earley parser
René Leermakers
Information Processing Letters
41
, 1992, pp. 87-91
Finding approximate solutions to NP-hard problems by neural networks is hard
Xin Yao
Information Processing Letters
41
, 1992, pp. 93-98
Finding a maximum set of independent chords in a circle
R.C. Chang
,
H.S. Lee
Information Processing Letters
41
, 1992, pp. 99-102
Searching for segments with largest relative overlap
Franz Aurenhammer
,
Gerd Stöckl
Information Processing Letters
41
, 1992, pp. 103-108
A self-stabilizing algorithm for constructing breadth-first trees
Shing-Tsaan Huang
,
Nian-Shing Chen
Information Processing Letters
41
, 1992, pp. 109-117
Fast inversion of Hankel and Toeplitz matrices
Luca Gemignani
Information Processing Letters
41
, 1992, pp. 119-123
Kolmogorov complexity and random graphs
W.W. Kirchherr
Information Processing Letters
41
, 1992, pp. 125-130
A constructive proof of Vizing's theorem
J. Misra
,
David Gries
Information Processing Letters
41
, 1992, pp. 131-133
A linear algorithm for bisecting a polygon
Thomas C. Shermer
Information Processing Letters
41
, 1992, pp. 135-140
The order of Appel's algorithm
Klaas Esselink
Information Processing Letters
41
, 1992, pp. 141-147
Parallel complexity of computing a maximal set of disjoint paths
Alok Aggarwal
Information Processing Letters
41
, 1992, pp. 149-151
Optimal parallel 3-coloring algorithm for rooted trees and its applications
Peter Rajc̑áni
Information Processing Letters
41
, 1992, pp. 153-156
Strings, trees, and patterns
Rakesh M. Verma
Information Processing Letters
41
, 1992, pp. 157-161
Seiten 1
2
3
>