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="Balc{\'a}zar, Jos{\'e} L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Provably fast training algorithms for support vector machines
José L. Balcázar
,
Yang Dai
,
Junichi Tanaka
,
Osamu Watanabe
Theory of Computing Systems
42
(4), 2008, pp. 568-595
A general dimension for query learning
José L. Balcázar
,
Jorge Castro
,
David Guijarro
,
Johannes Köbler
,
Wolfgang Lindner
Journal of Computer and System Sciences
73
(6), 2007, pp. 924-940
Horn axiomatizations for sequential data
José L. Balcázar
,
Gemma C. Garriga
Theoretical Computer Science
371
(3), 2007, pp. 247-264
Some structural complexity aspects of neural computation
José L. Balcázar
,
Ricard Gavaldà
,
Hava T. Siegelmann
,
Eduardo D. Sontag
Proceedings of the 8th Annual Conference on Structure in Complexity Theory, CSCT'93 (San Diego, California, May 1993)
, 1993, pp. 253-265
Logarithmic advice classes
José L. Balcázar
,
Uwe Schöning
Theoretical Computer Science
99
, 1992, pp. 279-290
Parallel complexity in the design and analysis of concurrent systems
Carme Àlvarez
,
José L. Balcázar
,
Joaquim Gabarró
,
Miklós Sántha
Lecture Notes in Computer Science
505
, 1991, pp. 288-303
Functional oracle queries as a measure of parallel time
Carme Álvarez
,
José L. Balcázar
,
Birgit Jenner
Lecture Notes in Computer Science
480
, 1991, pp. 422-433
Adaptive logspace and depth-bounded reducibilities
José L. Balcázar
Proceedings of the 6th Annual Conference on Structure in Complexity Theory, CSCT'91 (Chicago, Illinois, June 30-July 3, 1991)
, 1991, pp. 240-254
Strong and robustly strong polynomial-time reducibilities to sparse sets
Ricard Gavaldá
,
José L. Balcázar
Theoretical Computer Science
88
, 1991, pp. 1-14
Self-reducibility
José L. Balcázar
Journal of Computer and System Sciences
41
, 1990, pp. 367-388
The complexity of graph problems for succintly represented graphs
Antonio Lozano
,
José L. Balcázar
Lecture Notes in Computer Science
411
, 1989, pp. 277-286
On generalized Kolmogorov complexity
José L. Balcázar
,
Ronald V. Book
Lecture Notes in Computer Science
210
, 1986, pp. 334-340
Bi-immune sets for complexity classes
José L. Balcázar
,
Uwe Schöning
Math. Systems Theory
18
, 1985, pp. 1-10
Sparse oracles, lowness, and highness
José L. Balcázar
,
Ronald V. Book
,
Uwe Schöning
Lecture Notes in Computer Science
176
, 1984, pp. 185-193