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="Sen, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved algorithms for uniform partitions of points
P.K. Agarwal
,
B.K. Bhattacharya
,
S. Sen
Algorithmica
32
(4), 2002, pp. 521-539
Avoiding cross hybridization by choosing nonredundant targets on cDNA arrays
H.B. Nielsen
,
S. Knudsen
Bioinformatics
18
(2), 2002, pp. 321-322
An efficient output-size sensitive parallel algorithm for hidden-surface removal for terrains
N. Gupta
,
S. Sen
Algorithmica
31
(2), 2001, pp. 179-207
Promoter2.0: For the recognition of PoLII promoter sequences
S. Knudsen
Bioinformatics
15
(5), 1999, pp. 356-361
Parallel searching in generalized Monge arrays
A. Aggarwal
,
D. Kravets
,
J.K. Park
,
S. Sen
Algorithmica
19
, 1997, pp. 291-317
Compilation and equivalence of imperative objects
A.D. Gordon
,
P.D. Hankin
,
S.B. Lassen
Lecture Notes in Computer Science
1346
, 1997, pp. 74-87
Parallel searching in generalized Monge arrays with applications
A. Aggarwal
,
D. Kravets
,
J. Park
,
S. Sen
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'90 (Island of Crete, Greece, July 2-6, 1990)
, 1990, pp. 259-268
Computer programs for the rapid determination of enzyme kinetics on MS-DOS compatible microcomputers
R. Myers
,
S. Olsen
,
S. Maloy
Bioinformatics
6
(2), 1990, pp. 63-65
Randomized algorithms for binary search and load balancing with geometric applications
J. Reif
,
S. Sen
Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'90 (Island of Crete, Greece, July 2-6, 1990)
, 1990, pp. 327-337
Parallel sorting in two-dimensional VLSI models of computation
I. Scherson
,
S. Sen
IEEE Transactions on Computers
38
(2), 1989, February, pp. 238-249
A distributed spanning tree algorithm
K.E. Johansen
,
U.L. Jrgensen
,
S.H. Nielsen
,
S. Skyum
Lecture Notes in Computer Science
312
, 1988, pp. 1-12
The distance bound for sorting on mesh-connected processor arrays is tight
Y. Ma
,
S. Sen
,
I.D. Scherson
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 255-263
The looping algorithm extended to base
2^t
rearrangeable switching networks
S. Andersen
IEEE Transactions on Communications
COM-25
(10), 1977, October, pp. 1057-1063