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=Theory of Computing Systems AND YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved bounds for functions related to busy beavers
A.M. Ben-Amram
,
H. Petersen
Theory of Computing Systems
35
(1), 2002, pp. 1-11
On the representation of real numbers using regular languages
P. Lecomte
,
M. Rigo
Theory of Computing Systems
35
(1), 2002, pp. 13-38
Cross-correlation analysis of cryptographically useful Boolean functions and
S
-boxes
P. Sarkar
,
S. Maitra
Theory of Computing Systems
35
(1), 2002, pp. 39-57
Hamiltonicity of the hierarchical cubic network
Jung-Sheng Fu
,
Gen-Huey Chen
Theory of Computing Systems
35
(1), 2002, pp. 59-79
Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
A. Gross̈e
,
J. Rothe
,
G. Wechsung
Theory of Computing Systems
35
(1), 2002, pp. 81-93
Sorting and counting networks of arbitrary width and small depth
C. Busch
,
M. Herlihy
Theory of Computing Systems
35
(2), 2002, pp. 99-128
A comparison of asymptotically scalable superscalar processors
B.C. Kuszmaul
,
D.S. Henry
,
G.H. Loh
Theory of Computing Systems
35
(2), 2002, pp. 129-150
Scheduling threads for low space requirement and good locality
G.J. Narlikar
Theory of Computing Systems
35
(2), 2002, pp. 151-187
A simple end efficient parallel disk mergesort
R.D. Barve
,
J.S. Vitter
Theory of Computing Systems
35
(2), 2002, pp. 189-215
Data management in networks: Experimental evaluation of a provably good strategy
C. Krick
,
F. Meyer auf der Heide
,
H. Räcke
,
B. Vöcking
,
M. Westermann
Theory of Computing Systems
35
(2), 2002, pp. 217-245
On generalized connection caching
Susanne Albers
Theory of Computing Systems
35
(3), 2002, pp. 251-267
Optimizing traffic in DSM clusters: Fine-grain memory caching versus page migration/replication
An-Chow Lai
,
Babak Falsafi
Theory of Computing Systems
35
(3), 2002, pp. 269-287
Online scheduling of parallel programs on heterogeneous systems with applications to Cilk
Michael A. Bender
,
Michael O. Rabin
Theory of Computing Systems
35
(3), 2002, pp. 289-304
Diffusion schemes for load balancing on heterogeneous networks
Robert Elsässer
,
Burkhard Monien
,
Robert Preis
Theory of Computing Systems
35
(3), 2002, pp. 305-320
The data locality of work stealing
Umut A. Acar
,
Guy E. Blelloch
,
Robert D. Blumofe
Theory of Computing Systems
35
(3), 2002, pp. 321-347
DCAS-based concurrent deques
Ole Agesen
,
David L. Detlefs
,
Christine H. Flood
,
Alexander T. Garthwaite
,
Paul A. Martin
,
Mark Moir
,
Nir N. Shavit
,
Guy L., Jr. Steele
Theory of Computing Systems
35
(3), 2002, pp. 349-386
Black-box correctness tests for basic parallel data structures
Phillip B. Gibbons
,
John L. Bruno
,
Stegen Phillips
Theory of Computing Systems
35
(4), 2002, pp. 391-432
The mortality problem for matrices of low dimensions
O. Bournez
,
M. Branicky
Theory of Computing Systems
35
(4), 2002, pp. 433-448
The difference between polynomial-time many-one and truth-table reducibilities on distributional problems
Shin Aida
,
Rainer Schuler
,
Tatsuie Tsukiji
,
Osamu Watanabe
Theory of Computing Systems
35
(4), 2002, pp. 449-463
P
systems with global rules
Andrei Păun
Theory of Computing Systems
35
(5), 2002, pp. 471-481
Programmed mutagenesis is universal
Julia Khodor
,
David K. Gifford
Theory of Computing Systems
35
(5), 2002, pp. 483-499
Characterizing the micronuclear gene patterns in ciliates
Andrzej Ehrenfeucht
,
Tero Harju
,
Ion Petre
,
Grzegorz Rozenberg
Theory of Computing Systems
35
(5), 2002, pp. 501-519
Efficient on-line frequency allocation and call control in cellular networks
Ioannis Caragiannis
,
Christos Kaklamanis
,
Evi Papaioannou
Theory of Computing Systems
35
(5), 2002, pp. 521-543
Laying out the interconnection network of the transpose bijection
Shimon Even
,
Roni Kupershtok
Theory of Computing Systems
35
(5), 2002, pp. 545-558
The fully polynomial approximation algorithm for the
0-1
knapsack problem
Yingjie Liu
Theory of Computing Systems
35
(5), 2002, pp. 559-564
Seiten 1
2
>