Search results for: PATRICIA TRIES

• Asymmetric Renyi Problem and > PATRICIA Tries

  Publication

  • M. Drmota
  • A. Magner
  • W. Szpankowski

  - Year 2016

  In 1960 R´enyi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels and asks, what is the set of objects that have theselabels? Weconsider here anasymmetric version of the problem in which in every query an object is chosenwith probability p > 1/2 and we ignore “inconclusive” queries. We study the number of queries needed...

  Full text to download in external service

• A Note on a Problem Posed by D. E. Knuth on a Satisfiability Recurrence

  Publication

  • P. Jacquet
  • C. Knessel
  • W. Szpankowski

  - COMBINATORICS PROBABILITY & COMPUTING - Year 2014

  We resolve a conjecture proposed by D.E. Knuth concerning a recurrence arising in the satisfiability problem. Knuth's recurrence resembles recurrences arising in the analysis of tries, in particular PATRICIA tries, and asymmetric leader election. We solve Knuth's recurrence exactly and asymptotically, using analytic techniques such as the Mellin transform and analytic depoissonization.

  Full text to download in external service