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="Smith, J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the chromatic number of subsets of the Euclidean plane
M. Axenovich
,
J. Choi
,
M. Lastrina
,
T. McKay
,
J. Smith
,
B. Stanton
Graphs and Combinatorics
30
(1), 2014, pp. 71-81
Integer programming models and algorithms for the graph decontamination problem with mobile agents
John Penuel
,
J. Cole Smith
,
Siqian Shen
Networks
61
(1), 2013, pp. 1-19
Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
Siqian Shen
,
J. Cole Smith
Networks
60
(2), 2012, pp. 103-119
On the smallest simple, unipotent Bol loop
K.W. Johnson
,
J.D.H. Smith
Journal of Combinatorial Theory Series A
117
(6), 2010, pp. 790-798
Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
April K. Andreas
,
J. Cole Smith
Networks
53
(2), 2009, pp. 91-103
Dynamic programming algorithms for the conditional covering problem on path and extended star graphs
Jennifer A. Horne
,
J. Cole Smith
Networks
46
(4), 2005, pp. 177-185
A dynamic programming algorithm for the conditional covering problem on tree graphs
Jennifer A. Horne
,
J. Cole Smith
Networks
46
(4), 2005, pp. 186-197
Mapping subtasks with multiple versions on an ad hoc grid
S. Shivle
,
P. Sugavanam
,
H.J. Siegel
,
A.A. Maciejewski
,
T. Banka
,
K. Chindam
,
S. Dussinger
,
A. Kutruff
,
P. Penumarthy
,
P. Pichumani
,
P. Satyasekaran
,
D. Sendek
,
J. Smith
,
J. Sousa
,
J. Sridharan
,
J. Velazco
Parallel Computing
31
(7), 2005, pp. 671-690
A stochastic integer programming approach to solving a synchronous optical network ring design problem
J. Cole Smith
,
Andrew J. Schaefer
,
Joyce W. Yen
Networks
44
(1), 2004, pp. 12-26
Steiner minimal trees with one polygonal obstacle
J.F. Weng
,
J. MacGregor Smith
Algorithmica
29
(4), 2001, pp. 638-648
Downward separation fails catastrophically for limited nondeterminism classes
R. Beigel
,
J. Goldsmith
SIAM Journal on Computing
27
(5), 1998, pp. 1420-1429
Sharply bounded alternation and quasilinear time
S.A. Bloch
,
J.F. Buss
,
J. Goldsmith
Theory of Computing Systems
31
(2), 1998, pp. 187-214
Performance of fault-tolerant data and compute intensive programs over a network of workstations
J.A. Smith
,
S.K. Shrivastava
Theoretical Computer Science
196
(1-2), 1998, pp. 319-345
Fault-tolerant parallel applications using queues and actions
J. Smith
,
S. Shrivastava
Proceedings of the 1997 International Conference on Parallel Processing, ICPP'97 (Bloomingdale, Ill., August 11-15, 1997)
, 1997, pp. 145-149
On synchronisation in fault-tolerant data and compute intensive programs over a network of workstations
J. Smith
Lecture Notes in Computer Science
1300
, 1997, pp. 1025-1029
A system for fault-tolerant execution of data and compute intensive programs over a network of workstations
J.A. Smith
,
S.K. Shrivastava
Lecture Notes in Computer Science
1123
, 1996, pp. 487-495
Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in
E^3
J. MacGregor Smith
,
Badri Toppur
Discrete Applied Mathematics
71
(1-3), 1996, pp. 187-215
Topological network design of state-dependent queueing networks
J. MacGregor Smith
Networks
28
(1), 1996, pp. 55-68
On the Steiner ratio in 3-space
Warren D. Smith
,
J.MacGregor Smith
Journal of Combinatorial Theory Series A
69
(2), 1995, pp. 301-332
An
O(N^2)
heuristic for Steiner minimal trees in
E^3
J. MacGregor Smith
,
Rich Weiss
,
Minoo Patel
Networks
26
(4), 1995, pp. 273-289
Downward separation fails catastrophically for limited nondeterminism classes
R. Beigel
,
J. Goldsmith
Proceedings of the Ninth Annual Conference on Structure in Complexity Theory (Amsterdam, The Netherlands, June 28 - July 1, 1994)
, 1994, pp. 134-138
OLIGOGET - A computerized database system for controlling oligonucleotide production
J.M. Smith
Bioinformatics
9
(4), 1993, pp. 479-480
Path-distance heuristics for the Steiner problem in undirected networks
Pawel Winter
,
J. MacGregor Smith
Algorithmica
7
, 1992, pp. 309-327
Quantitative analysis of one-dimensional gel electrophoresis profiles
J.M Smith
,
D.J. Thomas
Bioinformatics
6
(2), 1990, pp. 93-99
Exploring ``multiple worlds'' in parallel
J.M. Smith
,
G.Q. Maguire
Proceedings of the 1989 International Conference on Parallel Processing. Vol.~2 Software, ICPP'89 (Penn State University, August 8-12, 1989)
, 1989, pp. 239-245
Seiten 1
2
>