论文信息 - Dynamic Maintenance of Majority Information in Constant Time per Update

Dynamic Maintenance of Majority Information in Constant Time per Update

Abstract We show how to maintain information about the existence of a majority colour in a set of elements under insertion and deletion of single elements using O(1) time and at most 4 equality tests on colours per update. No ordering information is used.

Sven Skyum | Gudmund Skovbjerg Frandsen | Sven Skyum | G. Frandsen

[1] Sven Skyum,et al. Dynamic Maintenance of Majority Information in Constant Time per Update , 1995 .

[2] M. Goldberg. An Adequate Left-Associated Binary Numeral System in the-Calculus ( Revised Version ) , 1995 .

[3] A. Ingólfsdóttir,et al. A Fully Abstract Denotational Model for Observational Congruence , 1995 .

[4] Noam Nisan,et al. Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version) , 1995, FOCS.

[5] Jens Palsberg,et al. Eta-expansion does The Trick , 1995, TOPL.

[6] Sten Agerholm,et al. Experiments with ZF Set Theory in HOL and Isabelle , 1995, TPHOLs.

[7] Mayer Goldberg. Constructing Fixed-Point Combina- tors Using Application Survival , 1995 .

[8] Allan Cheng,et al. Petri Nets, Traces, and Local Model Checking , 1995, Theor. Comput. Sci..

[9] Peter Bro Miltersen,et al. The Complexity of Finding Replicas Using Equality Tests , 1993, MFCS.

[10] Bruno Courcelle,et al. Monadic Second-Order Logic, Graphs and Unfoldings of Transition Systems , 1995 .