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.
Garbage collection in shared-environment closure reducers: Space-effficient depth first copying using a tailored approach
Stephen Thomas
Information Processing Letters
56
, 1995, pp. 1-7
Illumination of polygons with vertex lights
Vladimir Estivill-Castro
,
Joseph O'Rourke
,
Jorge Urrutia
,
Dianna Xu
Information Processing Letters
56
, 1995, pp. 9-13
Efficient learning with equivalence queries of conjunctions of modulo functions
Alberto Bertoni
,
Nicolò Cesa-Bianchi
,
Guido Fiorino
Information Processing Letters
56
, 1995, pp. 15-17
On the equity of mutual exclusion algorithms in distributed systems
Garrison W. Greenwood
Information Processing Letters
56
, 1995, pp. 19-22
A real-time algorithm for the
(n^2-1)
-puzzle
Ian Parberry
Information Processing Letters
56
, 1995, pp. 23-28
Node-to-node cluster fault tolerant routing in star graphs
Qian-Ping Gu
,
Shietung Peng
Information Processing Letters
56
, 1995, pp. 29-35
Parallel algorithms for connectivity problems on interval graphs
Sanjeev Saxena
,
N. Malahal Rao
Information Processing Letters
56
, 1995, pp. 37-44
Counting convex polygons in planar point sets
Joseph S.B. Mitchell
,
Günter Rote
,
Gopalakrishnan Sundaram
,
Gerhard Woeginger
Information Processing Letters
56
, 1995, pp. 45-49
Tighter bounds on a heuristic for a partition problem
Joseph Y.-T. Leung
,
W.-D. Wei
Information Processing Letters
56
, 1995, pp. 51-57
The parallel complexity of integer prefix summation
Torben Hagerup
Information Processing Letters
56
, 1995, pp. 59-64
On a generalization of the
p
-Center Problem
S.O. Krumke
Information Processing Letters
56
, 1995, pp. 67-71
Cryptanalysis of a public key system based on Diophantine equations
Thomas W. Cusick
Information Processing Letters
56
, 1995, pp. 73-75
A simpler derivation of schema hazard in genetic algorithms
Uday Kumar Chakraborty
Information Processing Letters
56
, 1995, pp. 77-78
The worst-case running time of the random simplex algorithm is exponential in the height
Andrei Z. Broder
,
Martin E. Dyer
,
Alan M. Frieze
,
Prabhakar Raghavan
,
Eli Upfal
Information Processing Letters
56
, 1995, pp. 79-81
An
O(\log n)
parallel algorithm for constructing a spanning tree on permutation graphs
Yue-Li Wang
,
Hon-Chan Chen
,
Chen-Yu Lee
Information Processing Letters
56
, 1995, pp. 83-87
An algorithm for "Ulam's Game" and its application to error correcting codes
Eugene L. Lawler
,
Sergei Sarkissian
Information Processing Letters
56
, 1995, pp. 89-93
A note on the Horton-Strahler number for random trees
Luc Devroye
,
Paul Kruszewski
Information Processing Letters
56
, 1995, pp. 95-99
Steiner set and connected domination in trapezoid graphs
Y. Daniel Liang
Information Processing Letters
56
, 1995, pp. 101-108
On reductions to sets that avoid EXPSPACE
V. Arvind
,
J. Köbler
,
M. Mundhenk
Information Processing Letters
56
, 1995, pp. 109-114
Minimizing elimination tree height can increase fill more than linearly
Bengt Aspvall
Information Processing Letters
56
, 1995, pp. 115-120
Multiple Quickselect-Hoare's find algorithm for several elements
Helmut Prodinger
Information Processing Letters
56
, 1995, pp. 123-129
An attack on the Needham-Schroeder public-key authentication protocol
Gavin Lowe
Information Processing Letters
56
, 1995, pp. 131-133
A combined BIT and TIMESTAMP algorithm for the list update problem
Susanne Albers
,
Bernhard von Stengel
,
Ralph Werchner
Information Processing Letters
56
, 1995, pp. 135-139
A type soundness proof for variables in LCF ML
Dennis Volpano
,
Geoffrey Smith
Information Processing Letters
56
, 1995, pp. 141-146
Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
Stasys Jukna
Information Processing Letters
56
, 1995, pp. 147-150
Seiten 1
2
3
4
5
6
7
8
9
10
>