„algorithm design“

Suchergebnisse

6.264 Treffer

• 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
• Reflections on “Representations of sets of Boolean functions by commutative rings” by Roman Smolensky
  Bruck, Jehoshua
• Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
  Buss, S. ; Impagliazzo, R. ; Krajíček, J. ; Pudlák, P. ; Razborov, A. A. ; Sgall, J.
• Upper and lower bounds for some depth-3 circuit classes
  Beigel, Richard ; Maciel, Alexis
• Lower bounds on arithmetic circuits via partial derivatives
  Nisan, Noam ; Wigderson, Avi
• Finding the closed partition of a planar graph
  Ramachandran, Vijaya ; Yang, Honghua
• Provably good pattern generators for a random pattern test
  Spencer, Thomas H.
• Lower bounds for set intersection queries
  Dietz, P. ; Mehlhorn, K. ; Raman, R. ; Uhrig, C.
• Designing secure communication protocols from trust specifications
  Papadimitriou, C. H. ; Rangan, V. ; Sideri, M.
• Isomorphic tree spanner problems
  Cai, L. ; Corneil, D.
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
  Borie, R. B.
• An improved technique for output-sensitive hidden surface removal
  Overmars, M. H. ; Sharir, M.
• Finding a closest visible vertex pair between two polygons
  Amato, N. M.