Algorithms and Computation

We design a variation of skip lists that performs well for generally biased access sequences. Given n items, each with a positive weight wi, 1 ≤ i ≤ n, the time to access item i is O ( 1 + log W wi ) , where W = ∑n i=1 wi; the data structure is dynamic. We present deterministic and randomized variations, which are nearly identical; the deterministic one simply ensures the balance condition that the randomized one achieves probabilistically. We use the same method to analyze both.

[1]  P. Erd Os,et al.  On the maximal number of disjoint circuits of a graph , 2022, Publicationes Mathematicae Debrecen.

[2]  Lawrence Snyder,et al.  On uniquely represented data strauctures , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[3]  Alon Itai,et al.  Finding a minimum circuit in a graph , 1977, STOC '77.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Vijay V. Vazirani,et al.  NC Algorithms for Computing the Number of Perfect Matchings in K3, 3-free Graphs and Related Problems , 1988, SWAT.

[6]  Extending Planar Graph Algorithms to K_3,3-Free Graphs , 1990, Inf. Comput..

[7]  Paul D. Seymour,et al.  Excluding a graph with one crossing , 1991, Graph Structure Theory.

[8]  André E. Kézdy,et al.  Sequential and parallel algorithms to find a K5 minor , 1992, SODA '92.

[9]  Jan Arne Telle,et al.  Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems , 1993, WADS.

[10]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[11]  Daniele Micciancio,et al.  Oblivious data structures: applications to cryptography , 1997, STOC '97.

[12]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[13]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[14]  Rolf Niedermeier,et al.  Upper Bounds for Vertex Cover Further Improved , 1999, STACS.

[15]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[16]  Rolf Niedermeier,et al.  New Upper Bounds for Maximum Satisfiability , 2000, J. Algorithms.

[17]  L. Cai,et al.  Parameterized tractability of some (efficient) Y-domination variants for planar graphs and t-degenerate graphs , 2000 .

[18]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[19]  Dimitrios M. Thilikos,et al.  Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs , 2001, Electron. Notes Discret. Math..

[20]  Moni Naor,et al.  Anti-persistence: history independent data structures , 2001, STOC '01.

[21]  Ljubomir Perkovic,et al.  Improved Parameterized Algorithms for Planar Dominating Set , 2002, MFCS.

[22]  Weijia Jia,et al.  Using Nondeterminism to Design Efficient Deterministic Algorithms , 2004, Algorithmica.