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="Rem, M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity of minimum biclique cover and minimum biclique decomposition for biparite domino-free graphs
J. Amilhastre
,
M.C. Vilarem
,
P. Janssen
Discrete Applied Mathematics
86
(2-3), 1998, pp. 125-144
Acceptance automata: A framework for specifying and verifying TCSP parallel systems
Luis M. Alonso
,
Ricardo Peña
Lecture Notes in Computer Science
506
, 1991, pp. 75-91
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
Strong bisimilarity on nets revisited
C. Autant
,
Z. Belmesk
,
Ph. Schnoebelen
Lecture Notes in Computer Science
506
, 1991, pp. 295-312
Embeddings of shuffle-like graphs in hypercubes
M. Baumslag
,
M.C. Heydemann
,
J. Opatrny
,
D. Sotteau
Lecture Notes in Computer Science
505
, 1991, pp. 179-190
Flexible scheduling of OR-parallelism in Aurora: The Bristol scheduler
Anthony Beaumont
,
S. Muthu Raman
,
Péter Szeredi
,
David H.D. Warren
Lecture Notes in Computer Science
506
, 1991, pp. 403-420
On the semantics of languages for massively parallel SIMD architectures
Luc Bougé
Lecture Notes in Computer Science
506
, 1991, pp. 166-183
Scheduling of OR-parallel Prolog on a scalable, reconfigurable, distributed-memory multiprocessor
J. Briat
,
M. Favre
,
C. Geyer
,
J. Chassin de Kergommeaux
Lecture Notes in Computer Science
506
, 1991, pp. 385-402
Managing a parallel heap efficiently
Sajal K. Das
,
Wen-Bing Horng
Lecture Notes in Computer Science
505
, 1991, pp. 270-287
On the design of deadlock-free adaptive routing algorithms for multicomputers: Design methodologies
J. Duato
Lecture Notes in Computer Science
505
, 1991, pp. 390-405
A formal specification of the process trellis
Michael Factor
Lecture Notes in Computer Science
506
, 1991, pp. 277-294
Models for dynamically placed concurrent processes
J. Fanchon
,
D. Millot
Lecture Notes in Computer Science
506
, 1991, pp. 92-109
Area complexity of multilective merging
Pavel Ferianc
,
Ondrej Sýkora
Lecture Notes in Computer Science
505
, 1991, pp. 209-218
Efficient global computations on a processor network with programmable logic
Jean Marie Filloque
,
Eric Gautrin
,
Bernard Pottier
Lecture Notes in Computer Science
505
, 1991, pp. 69-82
Search level parallel processing of production systems
Satoshi Fujita
,
Masafumi Yamashita
,
Tadashi Ae
Lecture Notes in Computer Science
506
, 1991, pp. 471-488
Towards an efficient hybrid dataflow architecture model
Guang R. Gao
,
Herbert H.J. Hum
,
Jean-Marc Monti
Lecture Notes in Computer Science
505
, 1991, pp. 355-371
Chaotic linear system solvers in a variable-grain data-driven multiprocessor system
Jean-Luc Gaudiot
,
Chih-Ming Lin
Lecture Notes in Computer Science
506
, 1991, pp. 331-348
Data flow implementation of generalized guarded commands
R. Govindarajan
,
Sheng Yu
Lecture Notes in Computer Science
505
, 1991, pp. 372-389
FORK: A high-level language for PRAMs
T. Hagerup
,
A. Schmitt
,
H. Seidl
Lecture Notes in Computer Science
505
, 1991, pp. 304-320
Static analysis of term graph rewriting systems
Chris Hankin
Lecture Notes in Computer Science
506
, 1991, pp. 367-384
Structural operational semantics for Kernel Andorra Prolog
Seif Haridi
,
Catuscia Palamidessi
Lecture Notes in Computer Science
506
, 1991, pp. 238-253
POMP or how to design a massively parallel machine with small developments
Philippe Hoogvorst
,
Ronan Keryell
,
Philippe Matherat
,
Nicolas Paris
Lecture Notes in Computer Science
505
, 1991, pp. 83-100
A denotational real-time semantics for shared processors
Jozef Hooman
Lecture Notes in Computer Science
506
, 1991, pp. 184-201
A novel high-speed memory organization for fine-grain multi-thread computing
Herbert H.J. Hum
,
Guang R. Gao
Lecture Notes in Computer Science
505
, 1991, pp. 34-51
Neural network-based decision making for large incomplete databases
A.R. Hurson
,
B. Jín
,
S.H. Pakzad
Lecture Notes in Computer Science
505
, 1991, pp. 321-337
Seiten 1
2
3
>