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.
A learning-theorectic characterization of classes of recursive functions
Martin Kummer
Information Processing Letters
54
, 1995, pp. 205-211
Decoding residue codes
Ferruccio Barsi
Information Processing Letters
54
, 1995, pp. 213-222
A note on the size of a multicast tree in hypercubes
Satoshi Fujita
Information Processing Letters
54
, 1995, pp. 223-227
Random generation of words in an algebraic language in linear binary space
Massimiliano Goldwurm
Information Processing Letters
54
, 1995, pp. 229-233
Unique Horn renaming and unique 2-satisfiability
Jean-Jaques Hébrard
Information Processing Letters
54
, 1995, pp. 235-239
A linear-time algorithm for drawing a planar graph on a grid
M. Chrobak
,
T.H. Payne
Information Processing Letters
54
, 1995, pp. 241-246
A note on lexicographic breadth first search for chordal graphs
Klaus Simon
Information Processing Letters
54
, 1995, pp. 249-251
A linear time algorithm to compute a dominating path in an AT-free graph
Derek G. Stephan Olariu Corneil
,
Lorna Stewart
Information Processing Letters
54
, 1995, pp. 253-257
Stabilizing phase-clocks
Ted Herman
,
Sukumar Ghosh
Information Processing Letters
54
, 1995, pp. 259-265
On-the-fly analysis of distributed computations
Eddy Fromentin
,
Claude Jard
,
Guy-Vincent Jourdan
,
Michel Raynal
Information Processing Letters
54
, 1995, pp. 267-274
Why is the 3D Delaunay triangulation difficult to construct?
Kokichi Sugihara
,
Hiroshi Inagaki
Information Processing Letters
54
, 1995, pp. 275-280
3-SAT=SAT for a class of normal modal logics
Stéphane Demri
Information Processing Letters
54
, 1995, pp. 281-287
Exponential lower bounds for the tree-like Hajós calculus
Kazuo Iwama
,
Toniann Pitassi
Information Processing Letters
54
, 1995, pp. 289-294
An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
Akihiro Fujiwara
,
Toshimitsu Masuzawa
,
Hideo Fujiwara
Information Processing Letters
54
, 1995, pp. 295-300
On the equivalence covering number of splitgraphs
A. Blokhuis
,
T. Kloks
Information Processing Letters
54
, 1995, pp. 301-304
A division property of the Fibonacci word
Aldo de Luca
Information Processing Letters
54
, 1995, pp. 307-312
Subword complexity of a generalized Thue-Morse word
John Tromp
,
Jeffrey Shallit
Information Processing Letters
54
, 1995, pp. 313-316
On the performance guarantee of neural networks for NP-hard optimization problems
V. Zissimopoulos
Information Processing Letters
54
, 1995, pp. 317-322
Producing a top-down parse order with bottom-up parsing
James P. Schmeiser
,
David T. Barnard
Information Processing Letters
54
, 1995, pp. 323-326
A simplified proof for a self-stabilizing protocol: A game of cards
Jörg Desel
,
Ekkart Kindler
,
Tobias Vesper
,
Rolf Walter
Information Processing Letters
54
, 1995, pp. 327-328
Trivalent Cayley graphs for interconnection networks
Premkumar Vadapalli
,
Pradip K. Srimani
Information Processing Letters
54
, 1995, pp. 329-335
\varepsilon
-discrepancy sets and their application for interpolation of sparse polynomials
Noga Alon
,
Yishay Mansour
Information Processing Letters
54
, 1995, pp. 337-342
About the expressive power of
CTL
combinators
F. Laroussinie
Information Processing Letters
54
, 1995, pp. 343-345
The influence of graph structure on generalized dimension exchange
B. Litow
Information Processing Letters
54
, 1995, pp. 347-353
A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy
Yen-Jen Oyang
Information Processing Letters
54
, 1995, pp. 355-358
Seiten
<
1
2
3
4
5
6
7
8
9
10
>