Average Case Analysis of Marking Algorithms

نویسندگان

  • Daniel S. Hirschberg
  • Lawrence L. Larmore
چکیده

The Lindstrom marking algorithm uses bounded workspace. Its time complexity is O(n) in all cases, but it has been assumed that the average case time complexity is O(n lg n). It is proven that the average case time complexity is Θ(n). Similarly, the average size of the Wegbreit bit stack is shown to be Θ(n).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two Tagless Variations on the Deutsch-Schorr-Waite Algorithm

We describe two variations on the DeutschSchorr-Waite (henceforth, simply D S W ) algorithm for marking finite, rooted, binary, directed graphs (henceforth simply referred to as graphs) which dispense with the tag bit while retaining the same overall structure. The first variation handles all graphs, just as D S W , but trades average O(log n) (worst case O(n)) workspace and O(n) time for O(1) ...

متن کامل

Randomized Paging Algorithms and Measures for their Performance

We study three raLdomized paging algorithms, using two different measures for their per­ formances. One of the measures is the competitive ratio which was introduced by Sleator and Tarjan [ST8S]. Although it is well-motivated, Ben-David and Borodin [BDB] have recently demonstrated some counter-intuitive features of this measure (concerning the roles of memory and finite look&head i'l online alg...

متن کامل

Service differentiation and performance of weighted window-based congestion control and packet marking algorithms in ECN networks

We investigate the service differentiation, in terms of average throughput, and the performance achieved using weighted window-based congestion control in networks supporting Explicit Congestion Notification (ECN). Our results show how service differentiation, queueing delay, and average throughput are affected by the increase and decrease rules of the end-system congestion control algorithms, ...

متن کامل

Case marking strategies

Two strategies of case marking in natural languages are discussed. These are defined as two violable constraints whose effects are shown to converge in the case of differential object marking but diverge in the case of differential subject marking. The strength of the case bearing arguments will be shown to be of utmost importance for case marking as well as voice alternations. The strength of ...

متن کامل

Evaluation of Tree Marking in Persian Ironwood-hornbeam Stands at Bahramnia Forestry Plan and Its Effect on Stand Structure

Tree marking can cause changes in forest. This study aimed to assess tree marking operation and to predict its effect on stand structure of Persian ironwood-hornbeam stands at Bahramnia forestry plan, north of Iran. Therefore 98 trees that were marked in compartment 9 of the mentioned forest in 2017 based on selection system and according to the recent laws of Forests, Range and Watershed Manag...

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Comput.

دوره 15  شماره 

صفحات  -

تاریخ انتشار 1986