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: Journal=International Journal of Foundations of Computer Science AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Geometric transformations on language families: The power of symmetry
Alexandru Mateescu
,
Grzegorz Rozenberg
,
Arto Salomaa
International Journal of Foundations of Computer Science
8
, 1997, pp. 1-14
Classifying predicates and languages
Carl H. Smith
,
Rolf Wiehagen
,
Thomas Zeugmann
International Journal of Foundations of Computer Science
8
, 1997, pp. 15-41
Complexity of task graph scheduling with fixed communication capacity
Lucian Finta
,
Zhen Liu
International Journal of Foundations of Computer Science
8
, 1997, pp. 43-66
Pattern languages versus parallel communicating grammar systems
Sorina Dumitrescu
,
Gheorghe Pȃun
,
Arto Salomaa
International Journal of Foundations of Computer Science
8
, 1997, pp. 67-80
On the complexity of commutativity analysis
Oscar H. Ibarra
,
Pedro C. Diniz
,
Martin C. Rinard
International Journal of Foundations of Computer Science
8
, 1997, pp. 81-94
Logspace reducibility: Models and equivalences
Lane A. Hemaspaandra
,
Zhigen Jiang
International Journal of Foundations of Computer Science
8
, 1997, pp. 95-108
A note on the dimensionality of modified Knödel graphs
Jean-Claude Bermond
,
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Stephane Perennes
International Journal of Foundations of Computer Science
8
, 1997, pp. 109-116
Hop-congestion trade-offs for high-speed networks
Evangelos Kranakis
,
Danny Krizanc
,
Andrzej Pelc
International Journal of Foundations of Computer Science
8
, 1997, pp. 117-126
Fault tolerance on star-graphs
Shuo-Cheng Hu
,
Chang-Biau Yang
International Journal of Foundations of Computer Science
8
, 1997, pp. 127-142
Communication issues in parallel systems with optical interconnections
Pascal Berthomé
,
Afonso Ferreira
International Journal of Foundations of Computer Science
8
, 1997, pp. 143-162
Efficient communication in folded Petersen networks
Sajal K. Das
,
Dirk H. Hohndel
,
Maximilian Ibel
,
Sabine R. Öhring
International Journal of Foundations of Computer Science
8
, 1997, pp. 163-185
Multitriangle: A constant node degree interconnection network
Jie Wu
,
Haifeng Qian
International Journal of Foundations of Computer Science
8
, 1997, pp. 187-209
Methods to overlap communications in parallel numerical algorithms
C. Calvin
,
L. Colombet
,
Ph. Michallon
International Journal of Foundations of Computer Science
8
, 1997, pp. 211-235
The complexity of deciding strictly non-blocking concentration and generalized-concentration properties
H.K. Dai
International Journal of Foundations of Computer Science
8
, 1997, pp. 237-252
Design and analysis of the symmetric Banyan network (SBN): A min with high performance and high fault tolerance
Young Wook Keum
,
Hwakyung Rim
International Journal of Foundations of Computer Science
8
, 1997, pp. 253-267
Routing on triangles, tori and honeycombs
Jop F. Sibeyn
International Journal of Foundations of Computer Science
8
, 1997, pp. 269-287
Index-shuffle graphs
Marc Baumslag
,
Bojana Obrenić
International Journal of Foundations of Computer Science
8
, 1997, pp. 289-304
Triple loop networks with minimal transmission delay
Xingde Jia
,
Weidong Su
International Journal of Foundations of Computer Science
8
, 1997, pp. 305-328
A scalable diffusion algorithm for dynamic mapping and load balancing on networks of arbitrary topology
A. Heirich
International Journal of Foundations of Computer Science
8
, 1997, pp. 329-346
The construction of large scale reconfigurable parallel computing systems (The architecture of the SC320)
Burkhard Monien
,
Ralf Diekmann
,
Reinhard Lüling
International Journal of Foundations of Computer Science
8
, 1997, pp. 347-361
A process alebraic approach to time granularity semantics
Padmanabhan Krishnan
International Journal of Foundations of Computer Science
8
, 1997, pp. 363-378
Parsing partially ordered multisets
Twan Basten
International Journal of Foundations of Computer Science
8
, 1997, pp. 379-407
Learning with natural imprecision
Mark A. Changizi
International Journal of Foundations of Computer Science
8
, 1997, pp. 409-424
Embedding torus automata into a ring of automata
Bruno Martin
International Journal of Foundations of Computer Science
8
, 1997, pp. 425-431
Constructivizing membership proofs in complexity classes
V. Arvind
International Journal of Foundations of Computer Science
8
, 1997, pp. 433-442
Seiten 1
2
>