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
[2]
Hilfe
Suche: Author="Fran{\c{c}}on, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Analysis of dynamic algorithms in Knuth's model
J. Françon
,
B. Randrianarimanana
,
R. Schott
Theoretical Computer Science
72
, 1990, pp. 147-167
Dynamic data structures with finite population: a combinatorial analysis
J. Françon
,
B. Randrianarimanana
,
R. Schott
Lecture Notes in Computer Science
380
, 1989, pp. 162-174
Comparison of algorithms controlling concurrent access to a database: A combinatorial approach
D. Arques
,
J. Françon
,
M.T. Guichet
,
P. Guichet
Theoretical Computer Science
58
, 1988, pp. 3-16
Sequence of operations analysis for dynamic data structures
P. Flajolet
,
J. Françon
,
J. Vuillemin
Journal of Algorithms
1
, 1980, pp. 111-141
Computing integrated costs of sequences of operations with application to dictionaries
P. Flajolet
,
J. Françon
,
J. Vuillemin
Proceedings of the 11th Annual ACM Symposium on Theory of Computing, STOC'79 (Atlanta, GA, April 30 - May 2, 1979)
, 1979, pp. 49-61
Description and analysis of an efficient priority queue representation
J. Françon
,
G. Viennot
,
J. Vuillemin
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 1-7
On the analysis of algorithms for trees
J. Françon
Theoretical Computer Science
4
(2), 1977, pp. 155-169