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="Aspnes, James"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight bounds for asynchronous renaming
Dan Alistarh
,
James Aspnes
,
Keren Censor-Hillel
,
Seth Gilbert
,
Rachid Guerraoui
Journal of the ACM
61
(3), 2014, pp. 18: 1-51
Effective storage capacity of labeled graphs
Dana Angluin
,
James Aspnes
,
Rida A. Bazzi
,
Jiang Chen
,
David Eisenstat
,
Goran Konjevod
Information and Computation
234
, 2014, pp. 44-56
Tight bounds for adopt-commit objects
James Aspnes
,
Faith Ellen
Theory of Computing Systems
55
(3), 2014, pp. 451-474
Lower bounds for restricted-use objects
James Aspnes
,
Hagit Attiya
,
Keren Censor-Hillel
,
Danny Hendler
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2012 (Pittsburgh, Pennsylvania, USA, June 25-27, 2012)
, 2012, pp. 172-181
Polylogarithmic concurrent data structures from monotone circuits
James Aspnes
,
Hagit Attiya
,
Keren Censor-Hillel
Journal of the ACM
59
(1), 2012, pp. 2: 1-24
Low-contention data structures
James Aspnes
,
David Eisenstat
,
Yitong Yin
Journal Parallel Distributed Computing
72
(5), 2012, pp. 705-715
Randomized load balancing by joining and splitting bins
James Aspnes
,
Yitong Yin
Information Processing Letters
112
(8-9), 2012, pp. 309-313
Tight bounds for anonymous adopt-commit objects
James Aspnes
,
Faith Ellen
Proceedings of the 23rd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2011 (San Jose, CA, USA, June 4-6, 2011)
, 2011, pp. 317-323
Optimally learning social networks with activations and suppressions
Dana Angluin
,
James Aspnes
,
Lev Reyzin
Theoretical Computer Science
411
(29-30), 2010, pp. 2729-2740
Combining shared-coin algorithms
James Aspnes
,
Hagit Attiya
,
Keren Censor
Journal Parallel Distributed Computing
70
(3), 2010, pp. 317-322
Low-contention data structures
James Aspnes
,
David Eisenstat
,
Yitong Yin
Proceedings of the 22nd Annual Symposium on Parallelism in Algorithms and Architectures, SPAA'2010 (Thira, Santorini, Greece, June 13-15, 2010)
, 2010, pp. 345-354
Learning a circuit by injecting values
Dana Angluin
,
James Aspnes
,
Jiang Chen
,
Yinghua Wu
Journal of Computer and System Sciences
75
(1), 2009, pp. 60-77
Towards a theory of data entanglement
James Aspnes
,
Joan Feigenbaum
,
Aleksandr Yampolskiy
,
Sheng Zhong
Theoretical Computer Science
389
(1-2), 2007, pp. 26-43
Learning a circuit by injecting values
Dana Angluin
,
James Aspnes
,
Jiang Chen
,
Yinghua Wu
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 584-593
Inoculation strategies for victims of viruses and the sum-of-squares partition problem
James Aspnes
,
Kevin Chang
,
Aleksandr Yampolskiy
Journal of Computer and System Sciences
72
(6), 2006, pp. 1077-1093
Fast construction of overlay networks
Dana Angluin
,
James Aspnes
,
Jiang Chen
,
Yinghua Wu
,
Yitong Yin
Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2005 (Las Vegas, Nevada, USA, July 18-20, 2005)
, 2005, pp. 145-154
Compositional competitiveness for distributed algorithms
James Aspnes
,
Orli Waarts
Journal of Algorithms
54
(2), 2005, pp. 127-151
The expansion and mixing time of skip graphs with applications
James Aspnes
,
Udi Wieder
Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'2005 (Las Vegas, Nevada, USA, July 18-20, 2005)
, 2005, pp. 126-134
Wait-free consensus with infnite arrivals
James Aspnes
,
Gauri Shah
,
Jatin Shah
Proceedings of the 34th Annual ACM Symposium on Theory of Computing, STOC'2002 (Montreal, Quebec, Canada, May 19-21, 2002)
, 2002, pp. 524-533
Fast deterministic consensus in a noisy environment
James Aspnes
Journal of Algorithms
45
(1), 2002, pp. 16-39
A combinatorial toolbox for protein sequence design and landscape analysis in the grand canonical model
James Aspnes
,
Julia Hartling
,
Ming-Yang Kao
,
Junhyong Kim
,
Gauri Shah
Lecture Notes in Computer Science
2223
, 2001, pp. 403-415
Fairness in scheduling
Miklos Ajtai
,
James Aspnes
,
Moni Naor
,
Yuval Rabani
,
Leonard J. Schulman
,
Orli Waarts
Journal of Algorithms
29
(2), 1998, pp. 306-357
Spreading rumors rapidly despite an adversary
James Aspnes
,
William Hurwood
Journal of Algorithms
26
(2), 1998, pp. 386-411
Lower bounds for distributed coin-flipping and randomized consensus
James Aspnes
Journal of the ACM
45
(3), 1998, pp. 415-450
Competitive analysis of distributed algorithms
James Aspnes
Lecture Notes in Computer Science
1442
, 1998, pp. 118-146
Seiten 1
2
>