UB Paderborn / Katalog / Suche / in CDI

Invitation to Fixed-Parameter Algorithms Parameterized Complexity Theory Parameterized Algorithmics: Theory, Practice and Prospects

Computer journal, 2007-03, Vol.51 (1), p.137-140

2007

Volltextzugriff (PDF)

A tight lower bound for restricted pir protocols

Computational complexity, 2006-05, Vol.15 (1), p.82-91

2006

Volltextzugriff (PDF)

Learning via queries

Journal of the ACM, 1992-07, Vol.39 (3), p.649-674

1992

Volltextzugriff (PDF)

Chapter 16 A survey of recursive combinatorics

Studies in Logic and the Foundations of Mathematics, 1998, Vol.139, p.1041-1176

Gasarch, W.

1998

Volltextzugriff (PDF)

The communication complexity of enumeration, elimination, and selection

Proceedings / IEEE Conference on Computational Complexity, 2000, p.44-53

2000

Volltextzugriff (PDF)

On selecting the k largest with restricted quadratic queries

Information processing letters, 1991-05, Vol.38 (4), p.193-195

Gasarch, William I.

1991

Volltextzugriff (PDF)

On bounded queries and approximation

SIAM journal on computing, 1997-02, Vol.26 (1), p.188-209

1997

Volltextzugriff (PDF)

On the complexity of finding the chromatic number of a recursive graph I: the bounded case

Annals of pure and applied logic, 1989-11, Vol.45 (1), p.1-38

1989

Volltextzugriff (PDF)

Implementing WS1S via finite automata : Performance issues

Lecture notes in computer science, 1998, p.75-86

1998

Volltextzugriff (PDF)

On the relative sizes of learnable sets

Theoretical computer science, 1998-05, Vol.197 (1), p.139-156

1998

Volltextzugriff (PDF)

Terse, Superterse, and Verbose Sets

Information and computation, 1993-03, Vol.103 (1), p.68-85

1993

Volltextzugriff (PDF)

Implementing WS1S via finite automata

Lecture notes in computer science, 1997, p.50-63

1997

Volltextzugriff (PDF)

Some connections between bounded query classes and non-uniform complexity

Information and computation, 2003-10, Vol.186 (1), p.104-139

2003

Volltextzugriff (PDF)

Constant time parallel sorting: an empirical view

Journal of computer and system sciences, 2003-08, Vol.67 (1), p.63-91

2003

Volltextzugriff (PDF)

When does a random Robin Hood win?

Theoretical computer science, 2003-07, Vol.304 (1-3), p.477-484

2003

Volltextzugriff (PDF)

On the complexity of finding the chromatic number of a recursive graph II: the unbounded case

Annals of pure and applied logic, 1989-12, Vol.45 (3), p.227-246

1989

Volltextzugriff (PDF)

Polynomial terse sets

Information and computation, 1988-04, Vol.77 (1), p.37-56

1988

Volltextzugriff (PDF)

Bounded queries in recursion theory: a survey

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference, 1991, p.62-78

Gasarch, W.

1991

Volltextzugriff (PDF)

The Communication Complexity of Enumeration, Elimination, and Selection

Journal of computer and system sciences, 2001-09, Vol.63 (2), p.148-185

2001

Volltextzugriff (PDF)

Training sequences

Theoretical computer science, 1989-08, Vol.66 (3), p.255-272

1989

Volltextzugriff (PDF)

Automata techniques for query inference machines

Annals of pure and applied logic, 2002-10, Vol.117 (1), p.169-201

2002

Volltextzugriff (PDF)

On Checking versus Evaluation of Multiple Queries

Information and computation, 1993-07, Vol.105 (1), p.72-93

1993

Volltextzugriff (PDF)

Learning via queries in [+, <]

The Journal of symbolic logic, 1992-03, Vol.57 (1), p.53-81

1992

Volltextzugriff (PDF)

OptP as the normal behavior of NP-complete problems

Mathematical Systems Theory, 1995-11, Vol.28 (6), p.487-514

1995

Volltextzugriff (PDF)

Max and min limiters

Archive for mathematical logic, 2002-07, Vol.41 (5), p.483-495

2002

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Invitation to Fixed-Parameter Algorithms Parameterized Complexity Theory Parameterized Algorithmics: Theory, Practice and Prospects

A tight lower bound for restricted pir protocols

Learning via queries

Chapter 16 A survey of recursive combinatorics

The communication complexity of enumeration, elimination, and selection

On selecting the k largest with restricted quadratic queries

On bounded queries and approximation

On the complexity of finding the chromatic number of a recursive graph I: the bounded case

Implementing WS1S via finite automata : Performance issues

On the relative sizes of learnable sets

Terse, Superterse, and Verbose Sets

Implementing WS1S via finite automata

Some connections between bounded query classes and non-uniform complexity

Constant time parallel sorting: an empirical view

When does a random Robin Hood win?

On the complexity of finding the chromatic number of a recursive graph II: the unbounded case

Polynomial terse sets

Bounded queries in recursion theory: a survey

The Communication Complexity of Enumeration, Elimination, and Selection

Training sequences

Automata techniques for query inference machines

On Checking versus Evaluation of Multiple Queries

Learning via queries in [+, <]

OptP as the normal behavior of NP-complete problems

Max and min limiters

Suchergebnisse filtern