Result 1 to 20 of 50 total
On minimal-time solutions of firing squad synchronization problems for networks. (English)
SIAM J. Comput. 41, No. 3, 618-669 (2012).
1
io-port 05928105 Ge, Dongliang;
Ruzzo, Elizabeth K.;
Shianna, Kevin V.;
He, Min;
Pelak, Kimberly;
Heinzen, Erin L.;
Need, Anna C.;
Cirulli, Elizabeth T.;
Maia, Jessica M.;
Dickson, Samuel P.;
Zhu, Mingfu;
Singh, Abanish;
Allen, Andrew S.;
Goldstein, David B.
SVA: software for annotating and visualizing sequenced human genomes. (English)
Bioinformatics 27, No. 14, 1998-2000 (2011).
2
Monte Carlo solution of the Boltzmann equation via a discrete velocity model (English)
J. Comput. Physics 230, No. 4, 1265-1280 (2011).
3
Game-themed programming assignment modules: A pathway for gradual integration of gaming context into existing introductory programming courses (English)
IEEE Trans. Education 54, No. 3, 416-427 (2011).
4
The effects of exposure time on memory of display advertisements (English)
ACM Conference on Electronic Commerce, 49-58 (2011).
5
Increasing legal requirements for interface accessibility (English)
CHI Extended Abstracts, 745-748 (2011).
6
Game-themed programming assignments for faculty: a case study (English)
SIGCSE, 270-274 (2010).
7
The dense k subgraph problem. (English)
Comput. Res. Repos. 2009, Article No. 0912.5327 (2009).
8
Selecting control genes for RT-QPCR using public microarray data. (English)
BMC Bioinform. 10 (2009).
9
Nonisomorphic curves that become isomorphic over extensions of coprime degrees. (English)
J. Algebra 320, No. 6, 2526-2558 (2008).
10
On the complexity of the “most general” undirected firing squad synchronization problem. (English)
Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17‒19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 244-255 (2007).
11
Strongly primitive elements (English)
SSC, 24-36 (2007).
12
On the complexity of the "most general" undirected firing squad synchronization problem (English)
ISAAC, 244-255 (2007).
13
Can memory be used adaptively by uniform algorithms? (English)
Anderson, James H. (ed.) et al., Principles of distributed systems. 9th international conference, OPODIS 2005, Pisa, Italy, December 12‒14, 2005. Revised selected papers. Berlin: Springer (ISBN 978-3-540-36321-7/pbk). Lecture Notes in Computer Science 3974, 32-46 (2006).
14
io-port 05326062 Jones, Lesley;
Goldstein, Darlene R.;
Hughes, Gareth P.;
Strand, Andrew;
Collin, Francois;
Dunnett, Stephen B.;
Kooperberg, Charles L.;
Aragaki, Aaron;
Olson, James M.;
Augood, Sarah J.;
Faull, Richard Lm;
Luthi-Carter, Ruth;
Moskvina, Valentina;
Hodges, Angela K.
Assessment of the relationship between pre-chip and post-chip quality measures for affymetrix genechip expression data. (English)
BMC Bioinform. 7, No. 1, 211 (2006).
15
Partition resampling and extrapolation averaging: Approximation methods for quantifying gene expression in large numbers of short oligonucleotide arrays. (English)
Bioinformatics 22, No. 19, 2364-2372 (2006).
16
On the complexity of the “most general” firing squad synchronization problem. (English)
Durand, Bruno (ed.) et al., STACS 2006. 23rd annual symposium on theoretical aspects of computer science, Marseille, France, February 23‒25, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-32301-3/pbk). Lecture Notes in Computer Science 3884, 696-711 (2006).
17
On the number of possible row and column sums of $0,1$-matrices. (English)
Electron. J. Comb. 13, No. 1, Research paper N8, 6 p. (2006).
18
On the number of possible row and column sums of 0, 1-matrices (English)
Electr. J. Comb. 13, No. 1 (2006).
19
On the complexity of the "most general" firing squad synchronization problem (English)
STACS, 696-711 (2006).
20
Result 1 to 20 of 50 total
Start
Contact
Print
General Help
