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=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Efficient pairing functions - And why you should care
Arnold L. Rosenberg
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 3-17
Mobile computing: Opportunities for parallel algorithms research
Albert Y. Zomaya
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 19-37
Cache miss analysis of 2D stencil codes with tiled time loop
Claudia Leopold
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 39-58
Designing parallel algorithms for hierarchical SMP clusters
Martin Schmollinger
,
Michael Kaufmann
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 59-78
Scalable and optimal speed-up parallel algorithms for template matching on arrays with reconfigurable optical buses
Chin-Hsiung Wu
,
Shi-Jinn Horng
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 79-98
On cost-optimal merge of two intransitive sorted sequences
Jie Wu
,
Stephen Olariu
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 99-106
Linear time recognition and optimizations for weak-bisplit graphs, bi-cographs and bipartite
P_6
-free graphs
V. Giakoumakis
,
J.M. Vanherpe
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 107-136
Linear layout of generalized hypercubes
Koji Nakano
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 137-156
Probabilistic rewriting
P
systems
Mutyam Madhu
International Journal of Foundations of Computer Science
14
(1), 2003, pp. 157-166
Optimal cellular network deployment reusing existing base stations
Guangbin Fan
,
Jingyuan Zhang
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 169-181
Distributed spanners with bounded degree for wireless ad hoc networks
Yu Wang
,
Xiang-Yang Li
,
Ophir Frieder
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 183-200
Broadcasting in ad hoc networks based on self-pruning
Jie Wu
,
Fei Dai
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 201-221
Fast clustering and minimum weight matching algorithms for very large mobile backbone wireless networks
A. Ferro
,
G. Pigola
,
A. Pulvirenti
,
D. Shasha
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 223-236
Neighbor aware adaptive power flooding (NAAP) in mobile ad hoc networks
Justin Lipman
,
Paul Boustead
,
John Judge
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 237-252
RNG relay subset flooding protocols in mobile ad hoc networks
Julien Cartigny
,
François Ingelrest
,
David Simplot
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 253-265
Computing shortest, fastest, and foremost journeys in dynamic networks
B. Bui Xuan
,
A. Ferreira
,
A. Jarry
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 267-285
Maximal independent set, weakly-connected dominating set, and induced spanners in wireless ad hoc networks
Khaled M. Alzoubi
,
Peng-Jun Wan
,
Ophir Frieder
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 287-303
A zonal algorithm for clustering an hoc networks
Yuanzhu Peter Chen
,
Arthur L. Liestman
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 305-322
A simple heuristic for minimum connected dominating set in graphs
Peng-Jun Wan
,
Khaled M. Alzoubi
,
Ophir Frieder
International Journal of Foundations of Computer Science
14
(2), 2003, pp. 323-333
Data structures for one-dimensional packet classification using most-specific-rule matching
Sartaj Sahni
,
Kun Suk Kim
,
Haibin Lu
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 337-358
On the competitiveness of online real-time scheduling with rate of progress guarantees
Michael A. Palis
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 359-370
Interconnection networks and their eigenvalues
Ke Qiu
,
Sajal K. Das
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 371-389
Sorting on single-channel wireless sensor networks
Jacir Luiz Bordim
,
Koji Nakano
,
Hong Shen
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 391-403
Interprocedural induction variable analysis
Peiyi Tang
,
Pen-Chung Yew
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 405-423
Block sorting is hard
Wolfgang W. Bein
,
Lawrence L. Larmore
,
Shahram Latifi
,
I. Hal Sudborough
International Journal of Foundations of Computer Science
14
(3), 2003, pp. 425-437
Seiten 1
2
3
>