- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: STACS 1986. Berlin / Heidelberg / New York, 1986, S. 142-152
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Paderborn
- (wer)
-
Universitätsbibliothek
- (wann)
-
1986
- Urheber
- URN
-
urn:nbn:de:hbz:466:2-6006
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:55 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Meyer auf der Heide, Friedhelm
- Universitätsbibliothek
Entstanden
- 1986
Ähnliche Objekte (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"
A PTAS for Scheduling Unrelated Machines of Few Different Types
Planar microfluidic processors
Programmable Quantum Processors
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
Photonic non-von Neumann 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"
A PTAS for Scheduling Unrelated Machines of Few Different Types
Planar microfluidic processors
Programmable Quantum Processors
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
Photonic non-von Neumann 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"
A PTAS for Scheduling Unrelated Machines of Few Different Types
Planar microfluidic processors
Programmable Quantum Processors
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