Publications

Found 4228 results
[ Author(Desc)] Title Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
F
Friedland, G., Vinyals O., & Darrell T. (2010).  Multimodal Location Estimation. 1245-1251.
Friedman, E. (2012).  Asymmetric Cost Sharing Mechanisms. Games and Economic Behavior. 75(1), 139-151.
Friedman, E., Shor M.., Shenker S. J., & Sopher B.. (2004).  An Experiment on Learning with Limited Information: Nonconvergence, Experimentation Cascades, and the Advantage of Being Slow. Games and Economic Behavior. 47(2), 325-352.
Friedman, E., Young K., Tremper G., Liang J., Landsberg A. S., & Schuff N. (2015).  Directed Network Motifs in Alzheimer’s Disease and Mild Cognitive Impairment. PLoS ONE.
Friedman, E., Landsberg A. S., Owen J. P., Li Y-O., & Mukherjee P. (2014).  Stochastic Geometric Network Models for Groups of Functional and Structural Connectomes. NeuroImage. 101,
Friedman, E., Landsberg A. S., Owen J., Hsieh W., Kam L., & Mukherjee P. (2016).  Edge correlations in spatial networks. Journal of Complex Networks. 1-14.
Friedman, E. J., Gkatzelis V., Psomas C-A., & Shenker S. J. (2019).  Fair and Efficient Memory Sharing: Confronting Free Riders. Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence.
Friedman, E., Psomas C-A., & Vardi S. (2015).  Pareto Optimal Dynamic Fair Division with Minimal Disruptions.
Friedman, E., Young K., Asif D., Jutla I., Liang M., Wilson S., et al. (2014).  Directed Progression Brain Networks in Alzheimer's Disease: Properties and Classification. Brain Connectivity. 4(5), 384-393.
Friedman, E., Racz M. Z., & Shenker S. J. (2015).  Dynamic Budget-Constrained Pricing in the Cloud.
Friedman, E., Ghodsi A., & Psomas C-A. (2014).  Strategyproof Allocation of Discrete Jobs on Multiple Machines. 529-546.
Friedrich, T., Oliveto P.. S., Sudholt D., & Witt C. (2009).  Analysis of Diversity-Preserving Mechanisms for Global Exploration. Evolutionary Computation. 17(4), 455-476.
Friedrich, T., He J., Hebbinghaus N., Neumann F., & Witt C. (2010).  Approximating Covering Problems by Randomized Search Heuristics using Multi-Objective Models. Evolutionary Computation. 18(4), 617-633.
Friedrich, T., & Sauerwald T. (2009).  Near-Perfect Load Balancing by Randomized Rounding. 121-130.
Friedrich, T., Sauerwald T., & Vilenchik D. (2009).  Smoothed Analysis of Balancing Networks. 472-483.
Friedrich, T., Sauerwald T., & Vilenchik D. (2010).  Smoothed Analysis of Balancing Networks. In Random Structures and Algorithms. 39(1), 115-138.
Friedrich, T., & Neumann F. (2010).  When to Use Bit-Wise Neutrality. Natural Computing. 9(1), 283-294.
Friedrich, T., Gairing M., & Sauerwald T. (2010).  Quasirandom Load Balancing. 1620-1629.
Friedrich, T., Horoba C., & Neumann F. (2009).  Multiplicative Approximations and the Hypervolume Indicator. 571-578.
Friedrich, T., Hebbinghaus N., & Neumann F. (2010).  Plateaus Can Be Harder in Multi-Objective Optimization. Theoretical Computer Science. 411(6), 854-864.
Friedrich, T., & Hebbinghaus N. (2008).  Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. 693-704.
Frieze, A., Karp R. M., & Reed B. (1995).  When is the assignment bound tight for the asymmetric traveling-salesman problem?. SIAM Journal on Computing. 24(3), 484-493.
Frieze, A., Karp R. M., & Reed B. (1992).  When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?.
Frik, A., Nurgalieva L., Bernd J., Lee J. S., & Schaub F. (2019).  Privacy and Security Threat Models and Mitigation Strategies of Older Adults. Proceedings of SOUPS '19.
Frik, A., Malkin N., Harbach M., Peer E., & Egelman S. (2019).  A Promise Is A Promise: The Effect Of Commitment Devices On Computer Security Intentions. Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems (CHI 2019).

Pages