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: Author="Puech, Claude"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
General inductive inference types based on linearly-ordered sets
Andris Ambainis
,
Rūsiņs̑ Freivalds
,
Carl H. Smith
Lecture Notes in Computer Science
1046
, 1996, pp. 243-253
Upper bounds on multiparty communication complexity of shifts
Andris Ambainis
Lecture Notes in Computer Science
1046
, 1996, pp. 631-642
Resource-bounded balanced genericity, stochasticity and weak randomness
Klaus Ambos-Spies
,
Elvira Mayordomo
,
Yongge Wang
,
Xizhong Zheng
Lecture Notes in Computer Science
1046
, 1996, pp. 63-74
Optimal bounds on the approximation of Boolean functions with consequences on the concept of hardness
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Lecture Notes in Computer Science
1046
, 1996, pp. 319-330
Solvable black-box group problems are low for
PP
V. Arvind
,
N.V. Vinodchandran
Lecture Notes in Computer Science
1046
, 1996, pp. 99-110
Optimal schedules for d-D grid graphs with communication delays
E. Bampis
,
C. Delorme
,
J.-C. König
Lecture Notes in Computer Science
1046
, 1996, pp. 655-666
Learning with confidence
Jānis Bārzdiņs̆
,
Rūsiņs̑ Freivalds
,
Carl H. Smith
Lecture Notes in Computer Science
1046
, 1996, pp. 207-218
Star-height of an IN-rational series
Frédérique Bassino
Lecture Notes in Computer Science
1046
, 1996, pp. 125-135
Cyclic languages and strongly cyclic languages
Marie-Pierre Béal
,
Olivier Carton
,
Christophe Reutenauer
Lecture Notes in Computer Science
1046
, 1996, pp. 49-59
Minimal forbidden words and symbolic dynamics
Marie-Pierre Béal
,
Filippo Mignosi
,
Antonio Restivo
Lecture Notes in Computer Science
1046
, 1996, pp. 555-566
Languages recognized by finite aperiodic groupoids
Martin Beaudry
Lecture Notes in Computer Science
1046
, 1996, pp. 113-124
On the power of non-observable actions in timed automata
Béatrice Bérard
,
Paul Gastin
,
Antoine Petit
Lecture Notes in Computer Science
1046
, 1996, pp. 257-268
Fault-tolerant shared memory simulations
Petra Berenbrink
,
Friedhelm Meyer auf der Heide
,
Volker Stemann
Lecture Notes in Computer Science
1046
, 1996, pp. 181-192
Trace rewriting: Computing normal forms in time
O(n\log n)
Michael Bertol
,
Volker Diekert
Lecture Notes in Computer Science
1046
, 1996, pp. 269-280
Optimal tree-based one-time digital signature schemes
Daniel Bleichenbacher
,
Ueli M. Maurer
Lecture Notes in Computer Science
1046
, 1996, pp. 363-374
Read-once projections and formal circuit verification with binary decision diagrams
Beate Bollig
,
Ingo Wegener
Lecture Notes in Computer Science
1046
, 1996, pp. 491-502
On the expressivity of the modal mu-calculus
J.C. Bradfield
Lecture Notes in Computer Science
1046
, 1996, pp. 479-490
New trends in quantum computing
Gilles Brassard
Lecture Notes in Computer Science
1046
, 1996, pp. 3-10
On competitive on-line paging with lookahead
Dany Breslauer
Lecture Notes in Computer Science
1046
, 1996, pp. 593-603
Compressibility and resource bounded measure
Harry Buhrman
,
Luc Longpré
Lecture Notes in Computer Science
1046
, 1996, pp. 13-24
The complexity of generating and checking proofs of membership
Harry Buhrman
,
Thomas Thierauf
Lecture Notes in Computer Science
1046
, 1996, pp. 75-86
On the existence of hard sparse sets under weak reductions
Jin-Yi Cai
,
Ashish V. Naik
,
D. Sivakumar
Lecture Notes in Computer Science
1046
, 1996, pp. 307-318
Fine separation of average time complexity classes
Jin-Yi Cai
,
Alan L. Selman
Lecture Notes in Computer Science
1046
, 1996, pp. 331-343
An aperiodic set of Wang cubes
Karel Culik III
,
Jarkko Kari
Lecture Notes in Computer Science
1046
, 1996, pp. 137-146
Some bounds on multiparty communication complexity of pointer jumping
Carsten Damm
,
Stasys Jukna
,
Jiȓí Sgall
Lecture Notes in Computer Science
1046
, 1996, pp. 643-654
Seiten 1
2
3
4
5
>