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=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The permutational graph: A new network topology
Satoshi Okawa
International Journal of Foundations of Computer Science
9
(1), 1998, pp. 3-11
The diameter and Hamiltonian cycle of the generalized de Bruijn graphs
UG_B(n,n(n+1))
Luz R. Nochefranca
,
Polly W. Sy
International Journal of Foundations of Computer Science
9
(1), 1998, pp. 13-23
The cube-of-rings interconnection network
Thomas J. Cortina
,
Zhiwei Xu
International Journal of Foundations of Computer Science
9
(1), 1998, pp. 25-37
A dynamic scheduling communication protocol and its analysis for hypercube networks
Ayan Banerjee
,
Emmanouel (Manos) Varvarigos
International Journal of Foundations of Computer Science
9
(1), 1998, pp. 39-56
Network properties of double and triple fixed step graphs
A.L. Liestman
,
J. Opatrny
,
M. Zaragozá
International Journal of Foundations of Computer Science
9
(1), 1998, pp. 57-76
Shuffle-ring: A new constant-degree network
Guihai Chen
,
Francis C.M. Lau
International Journal of Foundations of Computer Science
9
(1), 1998, pp. 77-98
Integer sorting and routing in arrays with reconfigurable optical buses
Sandy Pavel
,
Selim G. Akl
International Journal of Foundations of Computer Science
9
(1), 1998, pp. 99-120
Continuous routing in packet switches
Miltos D. Grammatikakis
,
Eric Fleury
,
Miro Kraetzl
International Journal of Foundations of Computer Science
9
(2), 1998, pp. 121-137
Suboptimal-optimal routing for LAN internetworking using transparent bridges
Roman Garcia
,
Jose Duato
International Journal of Foundations of Computer Science
9
(2), 1998, pp. 139-156
Performance analysis of wormhole routed
K
-ary
N
-trees
Fabrizio Petrini
,
Marco Vanneschi
International Journal of Foundations of Computer Science
9
(2), 1998, pp. 157-177
Topological constraints for sense of direction
Paola Flocchini
,
Nicola Santoro
International Journal of Foundations of Computer Science
9
(2), 1998, pp. 179-197
Permutation routing and sorting on the reconfigurable mesh
Sanguthevar Rajasekaran
,
Theodore McKendall
International Journal of Foundations of Computer Science
9
(2), 1998, pp. 199-211
An extended dimension order token distribution algorithm on
k
-ary
d
-cubes and its complexity
Claude G. Diderich
,
Marc Gengler
International Journal of Foundations of Computer Science
9
(2), 1998, pp. 213-234
Topological properties of the
(n,k)
-star graph
Wei-Kuo Chiang
,
Rong-Jaye Chen
International Journal of Foundations of Computer Science
9
(2), 1998, pp. 235-248
New results on computability of recurrence equations
Herve le Verge
,
Yannick Saouter
International Journal of Foundations of Computer Science
9
(3), 1998, pp. 249-275
Lindström quantifiers and leaf language definability
Hans-Jörg Burtschick
,
Heribert Vollmer
International Journal of Foundations of Computer Science
9
(3), 1998, pp. 277-294
Recognizable and logically definable languages of infinite computations in concurrent automata
Manfred Droste
,
Dietrich Kuske
International Journal of Foundations of Computer Science
9
(3), 1998, pp. 295-313
Minimal concept identification and reliability
Sanjay Jain
International Journal of Foundations of Computer Science
9
(3), 1998, pp. 315-320
The soundness of explicit substitution with nameless variables
Fairouz Kamareddine
International Journal of Foundations of Computer Science
9
(3), 1998, pp. 321-349
Processor lower bound formulas for array computations and parametric diophantine systems
Peter Capello
,
Ömer Eg̑eciog̑lu
International Journal of Foundations of Computer Science
9
(4), 1998, pp. 351-375
Vertex splitting in dags and applications to partial scan designs and lossy circuits
Doowon Paik
,
Sudhakar Reddy
,
Sartaj Sahni
International Journal of Foundations of Computer Science
9
(4), 1998, pp. 377-398
Sort order problems in relational databases
Kim S. Larsen
International Journal of Foundations of Computer Science
9
(4), 1998, pp. 399-429
On the conservativity of Leibniz equality
M.P.A. Sellink
International Journal of Foundations of Computer Science
9
(4), 1998, pp. 431-454