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=53
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On a question about learning nearly minimal programs
Sanjay Jain
Information Processing Letters
53
, 1995, pp. 1-4
A generalized notion of semantic independence
Martin Fränzle
,
Bernhard von Stengel
,
Arne Wittmüss
Information Processing Letters
53
, 1995, pp. 5-9
Completeness results concerning systolic tree automata and E0L languages
Angelo Monti
,
Alessandro Roncato
Information Processing Letters
53
, 1995, pp. 11-16
Lower bounds for sampling algorithms for estimating the average
Ran Canetti
,
Guy Even
,
Oded Goldreich
Information Processing Letters
53
, 1995, pp. 17-25
The reachability problem for finite cellular automata
Andrea Clementi
,
Russell Impagliazzo
Information Processing Letters
53
, 1995, pp. 27-31
Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
Priyalal Kulasinghe
,
Said Bettayeb
Information Processing Letters
53
, 1995, pp. 33-36
An efficient selection algorithm on the pyramid
C.C. Aggarwal
,
N. Jain
,
P. Gupta
Information Processing Letters
53
, 1995, pp. 37-47
On key agreement protocols based on tamper-proof hardware
Yuliang Zheng
Information Processing Letters
53
, 1995, pp. 49-54
Element perturbation problems of optimum spanning trees with two-parameter objectives
Yung-Cheng Chang
,
Lih-Hsing Hsu
Information Processing Letters
53
, 1995, pp. 55-59
The relativized relationship between probabilistically checkable debate systems, IP and PSPACE
Alexander Russell
,
Ravi Sundaram
Information Processing Letters
53
, 1995, pp. 61-68
A note on the complexity of local search problems
S.T. Fischer
Information Processing Letters
53
, 1995, pp. 69-75
Low exponent attack against elliptic curve RSA
Kaoru Kurosawa
,
Koji Okada
,
Shigeo Tsujii
Information Processing Letters
53
, 1995, pp. 77-83
The interval
B
-tree
Chuan-Heng Ang
,
Kok-Phuang Tan
Information Processing Letters
53
, 1995, pp. 85-89
Several practical protocols for authentication and key exchange
Chae Hoon Lim
,
Pil Joong Lee
Information Processing Letters
53
, 1995, pp. 91-96
On the security of SPLICE/AS - The authentication system in WIDE Internet
Tzonelih Hwang
,
Yung-Hsiang Chen
Information Processing Letters
53
, 1995, pp. 97-101
Two attacks on Neuman-Stubblebine authentication protocols
Tzonelih Hwang
,
Narn-Yih Lee
,
Chuan-Ming Li
,
Ming-Yung Ko
,
Yung-Hsiang Chen
Information Processing Letters
53
, 1995, pp. 103-107
On the minimum diameter spanning tree problem
Refael Hassin
,
Arie Tamir
Information Processing Letters
53
, 1995, pp. 109-111
An algorithm for dynamic data allocation in distributed systems
Ouri Wolfson
,
Sushil Jajodia
Information Processing Letters
53
, 1995, pp. 113-119
Sequential calculus
Burghard von Karger
,
C.A.R. Hoare
Information Processing Letters
53
, 1995, pp. 123-130
Fixed-point calculus
Mathematics of Program Construction Group
Information Processing Letters
53
, 1995, pp. 131-136
Constructing the Galois adjoint
The Eindhoven Tuesday Afternoon Club
Information Processing Letters
53
, 1995, pp. 137-139
Heuristics for a calculational proof
Edsger W. Dijkstra
Information Processing Letters
53
, 1995, pp. 141-143
Equational propositional logic
David Gries
,
Fred B. Schneider
Information Processing Letters
53
, 1995, pp. 145-152
Mapping a functional notation for parallel programs onto hypercubes
Jacob Kornerup
Information Processing Letters
53
, 1995, pp. 153-158
Constructing a program with exceptions
K.R.M. Leino
Information Processing Letters
53
, 1995, pp. 159-163
Seiten 1
2
3
>