Speeding up random access machines by few processors

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: In: STACS 1986. Berlin / Heidelberg / New York, 1986, S. 142-152

Classification: Informatik

Event: Veröffentlichung

(where): Paderborn

(who): Universitätsbibliothek

(when): 1986

Creator: Meyer auf der Heide, Friedhelm

URN: urn:nbn:de:hbz:466:2-6006

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 25.03.2025, 1:55 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Meyer auf der Heide, Friedhelm
Universitätsbibliothek

Time of origin

1986

Other Objects (12)

Feasible real random access machines

Feasible Real Random Access Machines

Lower bounds for solving linear diophantine equations on random access machines

Hochschulschrift

Monte Carlo methods with few random bits

Fotografie

Besucher vor Paiks "Random Access"

Planar microfluidic processors

Programmable Quantum Processors

A PTAS for Scheduling Unrelated Machines of Few Different Types

Random Access to Abstract Data Types

Turing machines with few accepting computations and low sets for PP

zweidimensionales bewegtes Bild

Spectral theory of unimodular random trees: a few results and many questions

Compilation for instruction parallel processors

Feasible real random access machines

Feasible Real Random Access Machines

Lower bounds for solving linear diophantine equations on random access machines

Hochschulschrift

Monte Carlo methods with few random bits

Fotografie

Besucher vor Paiks "Random Access"

Planar microfluidic processors

Programmable Quantum Processors

A PTAS for Scheduling Unrelated Machines of Few Different Types

Random Access to Abstract Data Types

Turing machines with few accepting computations and low sets for PP

zweidimensionales bewegtes Bild

Spectral theory of unimodular random trees: a few results and many questions

Compilation for instruction parallel processors

Feasible real random access machines

Feasible Real Random Access Machines

Lower bounds for solving linear diophantine equations on random access machines

Hochschulschrift

Monte Carlo methods with few random bits

Fotografie

Besucher vor Paiks "Random Access"

Planar microfluidic processors

Programmable Quantum Processors

A PTAS for Scheduling Unrelated Machines of Few Different Types

Random Access to Abstract Data Types

Turing machines with few accepting computations and low sets for PP

zweidimensionales bewegtes Bild

Spectral theory of unimodular random trees: a few results and many questions

Compilation for instruction parallel processors

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Speeding up random access machines by few processors

Object Details

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Feasible real random access machines

Feasible Real Random Access Machines

Lower bounds for solving linear diophantine equations on random access machines

Monte Carlo methods with few random bits

Besucher vor Paiks "Random Access"

Planar microfluidic processors

Programmable Quantum Processors

A PTAS for Scheduling Unrelated Machines of Few Different Types

Random Access to Abstract Data Types

Turing machines with few accepting computations and low sets for PP

Spectral theory of unimodular random trees: a few results and many questions

Compilation for instruction parallel processors

Feasible real random access machines

Feasible Real Random Access Machines

Lower bounds for solving linear diophantine equations on random access machines

Monte Carlo methods with few random bits

Besucher vor Paiks "Random Access"

Planar microfluidic processors

Programmable Quantum Processors

A PTAS for Scheduling Unrelated Machines of Few Different Types

Random Access to Abstract Data Types

Turing machines with few accepting computations and low sets for PP

Spectral theory of unimodular random trees: a few results and many questions

Compilation for instruction parallel processors

Feasible real random access machines

Feasible Real Random Access Machines

Lower bounds for solving linear diophantine equations on random access machines

Monte Carlo methods with few random bits

Besucher vor Paiks "Random Access"

Planar microfluidic processors

Programmable Quantum Processors

A PTAS for Scheduling Unrelated Machines of Few Different Types

Random Access to Abstract Data Types

Turing machines with few accepting computations and low sets for PP

Spectral theory of unimodular random trees: a few results and many questions

Compilation for instruction parallel processors

Related objects

Reset password