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="Beigel, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of modular graph automorphism
V. Arvind
,
R. Beigel
,
A. Lozano
SIAM Journal on Computing
30
(4), 2000, pp. 1299-1320
Molecular computing, bounded nondeterminism, and effcient recursion
R. Beigel
,
B. Fu
Algorithmica
25
(2-3), 1999, pp. 222-238
A comparison of resource-bounded molecular computation models
B. Fu
,
R. Beigel
Algorithmica
24
(2), 1999, pp. 87-95
The complexity of modular graph automorphism
V. Arvind
,
R. Beigel
,
A. Lozano
Lecture Notes in Computer Science
1373
, 1998, pp. 172-182
Downward separation fails catastrophically for limited nondeterminism classes
R. Beigel
,
J. Goldsmith
SIAM Journal on Computing
27
(5), 1998, pp. 1420-1429
The expressive power of voting polynomials
J. Aspnes
,
R. Beigel
,
M. Furst
,
S. Rudich
Combinatorica
14
(2), 1994, pp. 135-148
Downward separation fails catastrophically for limited nondeterminism classes
R. Beigel
,
J. Goldsmith
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 134-138
PP is closed under intersection
R. Beigel
,
N. Reingold
,
D. Spielman
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, STOC'91 (New Orleans, Louisiana, May 6-8, 1991)
, 1991, pp. 1-9
A note on the almost-everywhere hierarchy for nondeterministic time
E. Allender
,
R. Beigel
,
U. Hertrampf
,
S. Homer
Lecture Notes in Computer Science
415
, 1990, pp. 1-11
Some connections between bounded query classes and non-uniform complexity
A. Amir
,
R. Beigel
,
W.I. Gasarch
Proceedings of the 5th Annual Conference on Structure in Complexity Theory, CSCT'90 (Universitat Politcnica de Catalunya, Barcelona, Spain, July 8-11, 1990)
, 1990, pp. 232-243
Counting classes: Thresholds, parity, mods, and fewness
R. Beigel
,
J. Gill
,
U. Hertrampf
Lecture Notes in Computer Science
415
, 1990, pp. 49-57
Sorting
n
objects with a
k
-sorter
R. Beigel
,
J. Gill
IEEE Transactions on Computers
39
(5), 1990, May, pp. 714-716
On the power of probabilistic polynomial time:
P^{NP|\log|}\subseteq PP
R. Beigel
,
L.A. Hemachandra
,
G. Wechsung
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 225-227
Locating faults in a constant number of parallel testing rounds
R. Beigel
,
S.R. Kosaraju
,
G.F. Sullivan
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'89 (Santa Fe, New Mexico, June 18-21, 1989)
, 1989, pp. 189-198
Processor networks and interconnection networks without long wires
R. Beigel
,
C.P. Kruskal
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'89 (Santa Fe, New Mexico, June 18-21, 1989)
, 1989, pp. 42-51
On the relativized power of additional accepting paths
R. Beigel
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 216-224
A structural theorem that depends quantitatively on the complexity of SAT
R. Beigel
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 28-32