Skip to main content

7 Result(s)

within English Remove this filter Computer Science Remove this filter Computation by Abstract Devices Remove this filter Discrete Mathematics in Computer Science Remove this filter S. Muthukrishnan Remove this filter Chapter Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Budget Feasible Mechanisms for Experimental Design

    We present a deterministic, polynomial time, budget feasible mechanism scheme, that is approximately truthful and yields a constant (≈ 12.98) factor approximation for the Experimental Design Problem (EDP). By app...

    Thibaut Horel, Stratis Ioannidis, S. Muthukrishnan in LATIN 2014: Theoretical Informatics (2014)

  2. No Access

    Chapter and Conference Paper

    Scienceography: The Study of How Science Is Written

    Scientific literature has itself been the subject of much scientific study, for a variety of reasons: understanding how results are communicated, how ideas spread, and assessing the influence of areas or indiv...

    Graham Cormode, S. Muthukrishnan, **yun Yan in Fun with Algorithms (2012)

  3. No Access

    Chapter and Conference Paper

    Budget Optimization for Online Campaigns with Positive Carryover Effects

    While it is relatively easy to start an online advertising campaign, proper allocation of the marketing budget is far from trivial. A major challenge faced by the marketers attempting to optimize their campaig...

    Nikolay Archak, Vahab Mirrokni, S. Muthukrishnan in Internet and Network Economics (2012)

  4. No Access

    Chapter and Conference Paper

    Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions

    Zero Knowledge Proofs (ZKPs) are one of the most striking innovations in theoretical computer science. In practice, the prevalent ZKP methods are, at times, too complicated to be useful for real-life applicati...

    Michael O. Rabin, Yishay Mansour, S. Muthukrishnan… in Automata, Languages, and Programming (2012)

  5. No Access

    Chapter and Conference Paper

    Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions

    We design algorithms for computing approximately revenue-maximizing sequential posted-pricing mechanisms (SPM) in K-unit auctions, in a standard Bayesian model. A seller has K copies of an item to sell, and there...

    Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha… in Internet and Network Economics (2010)

  6. No Access

    Chapter and Conference Paper

    Selective Call Out and Real Time Bidding

    Ads on the Internet are increasingly sold via ad exchanges such as RightMedia, AdECN and Doubleclick Ad Exchange. These exchanges allow real-time bidding, that is, each time the publisher contacts the exchange...

    Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha… in Internet and Network Economics (2010)

  7. No Access

    Chapter and Conference Paper

    Estimating Entropy and Entropy Norm on Data Streams

    We consider the problem of computing information theoretic functions such as entropy on a data stream, using sublinear space.

    Amit Chakrabarti, Khanh Do Ba, S. Muthukrishnan in STACS 2006 (2006)