Register | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

neddimitrov's library [102 articles]

Recent papers added to neddimitrov's library.
  • Bidding to the Top: VCG and Equilibria of Position-Based Auctions
    Approximation and Online Algorithms (2007), pp. 15-28.
    by Gagan Aggarwal, Jon Feldman, S Muthukrishnan
    posted to auction keyword position by neddimitrov on 2008-03-21 23:33:26 as **
  • Truthful auctions for pricing search keywords
    (2006), pp. 1-7.
    by Gagan Aggarwal, Ashish Goel, Rajeev Motwani
    edited by Joan Feigenbaum, John CI Chuang, David M Pennock, Joan Feigenbaum, John CI Chuang, David M Pennock
    posted to auction keyword by neddimitrov on 2008-03-21 22:44:20 as **
  • Bandit Based Monte-Carlo Planning
    Machine Learning: ECML 2006 (2006), pp. 282-293.
    by Levente Kocsis, Csaba Szepesvári
    posted to bandit branch_bound mc mdp by neddimitrov on 2008-03-07 00:05:13 as **
  • An Analysis of Stochastic Shortest Path Problems
    Mathematics of Operations Research, Vol. 16 (August 1991), pp. 580-595.
    by DP Bertsekas, JN Tsitsiklis
    posted to mdp search by neddimitrov on 2008-03-06 19:15:11 as **
  • The Power of Two Choices in Randomized Load Balancing
    (1996)
    by MD Mitzenmacher
    posted to bibtex-import by neddimitrov on 2008-03-05 21:01:37 as **
  • Balanced Allocations
    SIAM Journal on Computing, Vol. 29, No. 1. (1999), pp. 180-200.
    by Yossi Azar, Andrei Z Broder, Anna R Karlin, Eli Upfal
    posted to coupon_collector urn by neddimitrov on 2008-03-05 20:30:57 as **
  • A Generalization of a Result of Erdös and Rényi
    Journal of Applied Probability, Vol. 14, No. 1. (1977), pp. 212-216.
    by Norman Kaplan
    posted to coupon_collector urn by neddimitrov on 2008-03-05 20:23:08 as **
  • A. de Moivre: 'De Mensura Sortis' or 'On the Measurement of Chance'
    International Statistical Review / Revue Internationale de Statistique, Vol. 52, No. 3. (1984), pp. 229-262.
    by A Hald, Abraham de Moivre, Bruce Mcclintock
    posted to coupon_collector urn by neddimitrov on 2008-03-05 20:04:36 as **
  • The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk
    Journal of Statistical Physics, Vol. 50, No. 1. (1 January 1988), pp. 109-186.
    by Neal Madras, Alan D Sokal
    posted to coupon_collector monte_carlo random_walk by neddimitrov on 2008-03-05 17:42:55 as ** along with 1 person kaz229
  • Expected Length of the Longest Probe Sequence in Hash Code Searching
    J. ACM, Vol. 28, No. 2. (April 1981), pp. 289-304.
    by Gaston H Gonnet
    posted to coupon_collector by neddimitrov on 2008-03-05 17:32:38 as **
  • Rapidly mixing Markov chains with applications in computer science and physics
    Computing in Science \& Engineering, Vol. 8, No. 2. (March 2006), pp. 30-41.
    by D Randall
    posted to bibtex-import coupon_collector mixing by neddimitrov on 2008-03-05 17:26:10 as **
  • Finding nucleolus of flow game
    (January 2006), pp. 124-131.
    by X Deng, Q Fang, X Sun
    posted to alg_game_theory cooperative game_theory bibtex-import by neddimitrov on 2008-03-02 02:19:32 as **
  • Nash Equilibria in a Sealed Bid Auction
    Management Science, Vol. 22, No. 4. (December 1975), pp. 487-497.
    by BT Smith, JH Case
    posted to auction core game_theory nash repeated bibtex-import by neddimitrov on 2008-03-02 02:00:58 as **
  • Convergence Issues in Competitive Games
    Approximation, Randomization, and Combinatorial Optimization (October 2004), pp. 183-194.
    by VS Mirrokni, A Vetta
    posted to alg_game_theory auction core game_theory nash repeated bibtex-import by neddimitrov on 2008-03-02 01:36:38 as **
  • Competitive Exchange
    Econometrica, Vol. 46, No. 3. (May 1978), pp. 577-585.
    by R Wilson
    posted to auction core game_theory repeated bibtex-import by neddimitrov on 2008-03-01 19:58:20 as **
  • An Optimal Branch-And-Bound Procedure for the Constrained Path, Moving Target Search Problem
    Operations Research, Vol. 38, No. 1. (1990), pp. 110-114.
    by James N Eagle, James R Yee
    posted to mdp moving_target search by neddimitrov on 2008-02-28 22:45:53 as **
  • Search for a Moving Target: The FAB Algorithm
    Operations Research, Vol. 31, No. 4. (1983), pp. 739-751.
    by Alan R Washburn
    posted to mdp moving_target search by neddimitrov on 2008-02-28 22:44:35 as **
  • Optimal Search for a Moving Target in Discrete Time and Space
    Operations Research, Vol. 28, No. 6. (1980), pp. 1275-1289.
    by Scott S Brown
    posted to mdp moving_target search by neddimitrov on 2008-02-28 22:42:45 as ** along with 1 person abrentnall
  • The Optimal Search for a Moving Target When the Search Path is Constrained
    Operations Research, Vol. 32, No. 5. (1984), pp. 1107-1115.
    by James N Eagle
    posted to mdp moving_target search by neddimitrov on 2008-02-28 22:40:21 as ** along with 1 person knowlengr
  • The complexity of computing a Nash equilibrium
    (May 2006), pp. 71-78.
    by C Daskalakis, PW Goldberg, CH Papadimitriou
    posted to alg_game_theory nash by neddimitrov on 2008-02-27 22:40:16 as ** along with 1 person caramanis
  • Randomized parallel communication
    (August 1982), pp. 60-72.
    by R Aleliunas
    posted to delay_sequence by neddimitrov on 2008-02-27 20:35:50 as **
  • Efficient Schemes for Parallel Communication
    Journal of the ACM, Vol. 31, No. 3. (July 1984), pp. 507-517.
    by E Upfal
    posted to delay_sequence by neddimitrov on 2008-02-27 20:35:27 as **
  • Analysis of the evolution of peer-to-peer systems
    (July 2002), pp. 233-242.
    by Liben D Nowell, H Balakrishnan, D Karger
    posted to dht by neddimitrov on 2008-02-27 20:11:12 as **
  • How to Emulate Shared Memory
    Journal of Computer and System Sciences, Vol. 42 (1991), pp. 307-326.
    by AG Ranade
    posted to no-tag by neddimitrov on 2008-02-25 06:08:08 as **
  • Randomized Algorithms
    (1995)
    by R Motwani, P Raghavan
    posted to no-tag by neddimitrov on 2008-02-25 06:08:08 as **
  • Extremal Combinatorics
    (2001)
    by S Jukna
    posted to no-tag by neddimitrov on 2008-02-25 06:08:08 as **
  • Optimal Cover Time for a Graph-Based Coupon Collector Process.
    No. TR--05--01. (January 2005)
    by NB Dimitrov, CG Plaxton
    posted to no-tag by neddimitrov on 2008-02-25 06:08:08 as **
  • The Probabilistic Method
    (1991)
    by N Alon, JH Spencer
    posted to no-tag by neddimitrov on 2008-02-25 06:08:08 as **
  • notes Problems and Results in Extremal Combinatorics, II
    Discrete Mathematics (2007)
    by N Alon
    posted to no-tag by neddimitrov on 2008-02-25 06:08:07 as **
  • A Stochastic Process on the Hypercube with Applications to Peer-to-Peer Networks
    (2003), pp. 575-584.
    by M Adler, E Halperin, RM Karp, VV Vazirani
    posted to no-tag by neddimitrov on 2008-02-25 06:08:07 as **
  • Facility location: distributed approximation
    (July 2005), pp. 108-117.
    by T Moscibroda, R Wattenhofer
    posted to no-tag by neddimitrov on 2008-02-25 06:02:59 as **
  • Speed is as powerful as clairvoyance
    Journal of the ACM, Vol. 47 (July 2000), pp. 617-643.
    by B Kalyanasundaram, K Pruhs
    posted to no-tag by neddimitrov on 2008-02-25 06:02:58 as **
  • Amortized efficiency of list update and paging rules
    Communications of the ACM, Vol. 28 (February 1985), pp. 202-208.
    by DD Sleator, RE Tarjan
    posted to no-tag by neddimitrov on 2008-02-25 06:02:58 as **
  • Optimal time-critical scheduling via resource augmentation
    (July 1997), pp. 140-149.
    by CA Phillips, C Stein, E Torng, J Wein
    posted to no-tag by neddimitrov on 2008-02-25 06:02:58 as **
  • Matroids, secretary problems, and online mechanisms
    (January 2007), pp. 434-443.
    by M Babaioff, N Immorlica, R Kleinberg
    posted to auction matroid online by neddimitrov on 2008-02-25 06:02:57 as **
  • Combinatorial Optimization: Networks and Matroids
    (2001)
    by E Lawler
    posted to no-tag by neddimitrov on 2008-02-25 06:02:57 as **
  • Random Sampling and Greedy Sparsification for Matroid Optimizaiton Problems
    Mathematical Programming, Vol. 82 (June 1998), pp. 41-81.
    by D Karger
    posted to no-tag by neddimitrov on 2008-02-25 06:02:57 as **
  • A multiple-choice secretary algorithm with applications to online auctions
    (January 2005), pp. 630-631.
    by R Kleinberg
    posted to auction matroid online by neddimitrov on 2008-02-25 06:02:57 as **
  • Who Solved the Secretary Problem?
    Statistical Science, Vol. 4 (August 1989), pp. 282-289.
    by T Ferguson
    posted to no-tag by neddimitrov on 2008-02-25 06:02:57 as **
  • Dynamic Programming and Decision Theory
    Applied Statistics, Vol. 10 (March 1961), pp. 39-51.
    by DV Lindley
    posted to no-tag by neddimitrov on 2008-02-25 06:02:57 as **
  • The Secretary Problem and Its Extensions: A Review
    International Statistical Review, Vol. 51 (August 1983), pp. 189-206.
    by PR Freeman
    posted to no-tag by neddimitrov on 2008-02-25 06:02:56 as **
  • What is a Matroid?
    Cubo, Vol. 5 (2003), pp. 179-218.
    by J Oxley
    posted to no-tag by neddimitrov on 2008-02-25 06:02:56 as **
  • Heuristics for the fixed cost median problem
    Mathematical Programming, Vol. 22 (1982), pp. 148-162.
    by DS Hochbaum
    posted to no-tag by neddimitrov on 2008-02-21 06:04:15 as **
  • A Plant and WareHouse Location Problem
    Operational Research Quarterly, Vol. 28 (1977), pp. 547-554.
    by L Kaufman, MV Eede, P Hansen
    posted to no-tag by neddimitrov on 2008-02-21 06:04:14 as **
  • Optimal Cover Time for a Graph-Based Coupon Collector Process
    (2005), pp. 702-716.
    by N Dimitrov, CG Plaxton
    posted to no-tag by neddimitrov on 2008-02-21 06:04:14 as **
  • Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes
    (1991)
    by FT Leighton
    posted to no-tag by neddimitrov on 2008-02-21 06:04:14 as **
  • Approximation Algorithms
    (2001)
    by VV Vazirani
    posted to no-tag by neddimitrov on 2008-02-21 06:04:14 as **
  • Online Computation and Competitive Analysis
    (1998)
    by A Borodin, El R Yaniv
    posted to no-tag by neddimitrov on 2008-02-21 06:04:13 as **
  • Facility Location: applications and theory
    (2002)
    by Z Drezner, HW Hamacher
    posted to no-tag by neddimitrov on 2008-02-21 06:04:13 as **
  • The Price of Robustness
    Operations Research, Vol. 52 (2004), pp. 35-53.
    by D Bertsimas, M Sim
    posted to no-tag by neddimitrov on 2008-02-21 06:04:13 as **
    • Note: You may cite this page as: http://www.citeulike.org/user/neddimitrov

    Result page: 1 2 3 Next RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.