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
[3]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A new formalism for relational algebra
Kim S. Larsen
,
Michael I. Schwartzbach
,
Erik M. Schmidt
Information Processing Letters
41
, 1992, pp. 163-168
Optimal fault-tolerant routings for connected graphs
Koichi Wada
,
Yupin Luo
,
Kimio Kawaguchi
Information Processing Letters
41
, 1992, pp. 169-174
Axiomatizing fixpoint logics
Andrzej Szalas
Information Processing Letters
41
, 1992, pp. 175-180
An efficient algorithm for the all pairs suffix-prefix problem
Dan Gusfield
,
Gad M. Landau
,
Baruch Schieber
Information Processing Letters
41
, 1992, pp. 181-185
Solving the satisfiability problem by using randomized approach
L.C. Wu
,
C.Y. Tang
Information Processing Letters
41
, 1992, pp. 187-190
Counting convex
k
-gons in planar point sets
Günther Rote
,
Gerhard Woeginger
Information Processing Letters
41
, 1992, pp. 191-194
Head-strictness is not a monotonic abstract property
Samuel Kamin
Information Processing Letters
41
, 1992, pp. 195-198
The graph of multiplication is equivalent to counting
Samuel R. Buss
Information Processing Letters
41
, 1992, pp. 199-201
Improved bounds for covering complete uniform hypergraphs
Jaikumar Radhakrishnan
Information Processing Letters
41
, 1992, pp. 203-207
A distributed self-stabilizing solution to the dining philosophers problem
Debra Hoover
,
Joseph Poole
Information Processing Letters
41
, 1992, pp. 209-213
Connected domination and Steiner set on weighted permutation graphs
K. Arvind
,
C. Pandu Rangan
Information Processing Letters
41
, 1992, pp. 215-220
A simple lower bound for monotone clique using a communication game
Mikael Goldmann
,
Johan Håstad
Information Processing Letters
41
, 1992, pp. 221-226
Optimal embedding of 2-D torus into ring
Eva Ma
,
Bhagirath Narahari
,
Lixin Tao
Information Processing Letters
41
, 1992, pp. 227-231
A
\P
-complete language describable with iterated shuffle
Takayoshi Shoudai
Information Processing Letters
41
, 1992, pp. 233-238
Alternative developments of cyclic-permutation algorithms
Tom Whaley
Information Processing Letters
41
, 1992, pp. 239-241
An improved parallel algorithm for computing the generalized inverse
A^+
Guorong Wang
Information Processing Letters
41
, 1992, pp. 243-251
A dynamic programming solution to the
n
-queens problem
Igor Rivin
,
Ramin Zabih
Information Processing Letters
41
, 1992, pp. 253-256
Edge intersection on the hypercube computer
Chandrasekhar Narayanaswami
,
William Randolph Franklin
Information Processing Letters
41
, 1992, pp. 257-262
Generating permutations of a bag by interchanges
Chun Wa Ko
,
Frank Ruskey
Information Processing Letters
41
, 1992, pp. 263-269
An algorithm for fraternal orientation of graphs
J. Urrutia
,
F. Gavril
Information Processing Letters
41
, 1992, pp. 271-274
Scheduling multiprocessor tasks on three dedicated processors
J. Bƚażewicz
,
P. Dell'Olmo
,
M. Drozdowski
,
M.G. Speranza
Information Processing Letters
41
, 1992, pp. 275-280
R
-generability, and definability in branching time logics
Mads Dam
Information Processing Letters
41
, 1992, pp. 281-287
Almost all boolean functions have no linear symmetries
Michael Clausen
Information Processing Letters
41
, 1992, pp. 291-292
Confluence of the lambda calculus with left-linear algebraic rewriting
Fritz Müller
Information Processing Letters
41
, 1992, pp. 293-299
Linear congruence equations for the solutions of the
N
-queens problem
Cengiz Erbas
,
Murat M. Tanik
,
Zekeriya Aliyazicioglu
Information Processing Letters
41
, 1992, pp. 301-306
Seiten
<
1
2
3
>