„Algorithms & Data Structures“

Suchergebnisse

3.154 Treffer

• Finding all periods and initial palindromes of a string in parallel
  Breslauer, D. ; Galil, Z.
• Guest editor's foreword
  Raghavan, Prabhakar
• Point Set pattern matching ind-dimensions
  Rezende, P. J. de ; Lee, D. T.
• On greedy heuristics for steiner minimum trees
  Du, Ding -Zhu
• Random parallel algorithms for finding exact branchings, perfect matchings, and cycles
  Bruschi, D. ; Ravasio, F.
• A new measure for the study of on-line algorithms
  Ben-David, S. ; Borodin, A.
• Dynamic half-space range reporting and its applications
  Agarwal, P. K. ; Matoušek, J.
• Coloring inductive graphs on-line
  Irani, Sandy
• Randomized competitive algorithms for the list update problem
  Reingold, Nick ; Westbrook, Jeffery ; Sleator, Daniel D.
• Staircase visibility and computation of kernels
  Schuierer, S. ; Wood, D.
• On the power of randomization in on-line algorithms
  Ben-David, S. ; Borodin, A. ; Karp, R. ; Tardos, G. ; Wigderson, A.
• Bottom-up mergesort — A detailed analysis
  Panny, W. ; Prodinger, H.
• An efficient parallel algorithm for shortest paths in planar layered digraphs
  Subramanian, S. ; Tamassia, R. ; Vitter, J. S.
• Balancing minimum spanning trees and shortest-path trees
  Khuller, S. ; Raghavachari, B. ; Young, N.
• A 2n−2 step algorithm for routing in ann ×n array with constant-size queues
  Leighton, T. ; Makedon, F. ; Tollis, I. G.
• Approximate regular expression pattern matching with concave gap penalties
  Knight, J. R. ; Myers, E. W.
• Can PAC learning algorithms tolerate random attribute noise?
  Goldman, S. A. ; Sloan, R. H.
• Characterizing and recognizing the visibility graph of a funnel-shaped polygon
  Choi, Seung-Hak ; Shin, Sung Yong ; Chwa, Kyung-Yong
• Preface of the Special Issue Dedicated to Selected Papers from IWOCA 2022
  Bazgan, Cristina ; Fernau, Henning
• Linear Space Data Structures for Finite Groups with Constant Query-Time
  Das, Bireswar ; Kumar, Anant ; Sharma, Shivdutt ; Thakkar, Dhara