CS Structure

About CS Structure | Search | Help  

 

  • neural network; genetic algorithm; finite element; mobile robot ( Subthemes )
  •          finite element; element method; differential equation; domain decomposition ( Subthemes )
  •                  collision detection; motion planning; voronoi diagram; point location ( Subthemes )
  •                          nearest neighbor; approximate nearest; range searching; neighbor searching ( Subthemes )
  • INTRODUCTION TO ALGORITHMS - CORMEN, LEISERSON, RIVEST  
    By
    Date 
    Refs | Theme tree | Cited by 2845 This paper is cited in the following contexts

    Citation List: key=1000453
     

    Citation List:

    Citation Tree

    1) SHORTEST PATHS ALGORITHMS: THEORY AND EXPERIMENTAL EVALUATION  
    By Andrew V. Goldberg    Boris V. Cherkassky
    Date  February 1999
    Refs | Theme tree | Cited by 74 |  CiteSeer   (Hub and Authority Citation)

    2) QOS ROUTING MECHANISMS AND OSPF EXTENSIONS  
    By
    Date  December 1996
    Refs | Theme tree | Cited by 122 |  CiteSeer   (Authority Citation)

    3) A COMPARISON OF SORTING ALGORITHMS FOR THE CONNECTION MACHINE CM-2  
    By Bruce M. Maggs    C. Greg Plaxton    Charles E. Leiserson    Guy E. Blelloch    Marco Zagha    Stephen J. Smith
    Date  February 1997
    Refs | Theme tree | Cited by 140 |  CiteSeer  

    4) AN ANALYSIS OF DAG-CONSISTENT DISTRIBUTED SHARED-MEMORY ALGORITHMS  
    By Charles E. Leiserson    Christopher F. Joerg    Keith H. Randall    Matteo Frigo    Robert D. Blumofe
    Date  January 1970
    Refs | Theme tree | Cited by 47 |  CiteSeer  

    5) THE IMPLEMENTATION OF THE CILK-5 MULTITHREADED LANGUAGE  
    By Charles E. Leiserson    Keith H. Randall    Matteo Frigo
    Date  January 1999
    Refs | Theme tree | Cited by 58 |  CiteSeer  

    6) ON FINDING MULTI-CONSTRAINED PATHS  
    By Klara Nahrstedt    Shigang Chen
    Date  March 1998
    Refs | Theme tree | Cited by 33 |  CiteSeer  

    7) QOS ROUTING IN NETWORKS WITH UNCERTAIN PARAMETERS  
    By Ariel Orda    Dean H. Lorenz
    Date  May 1998
    Refs | Theme tree | Cited by 50 |  CiteSeer  

    8) BICRITERIA NETWORK DESIGN PROBLEMS  
    By Daniel Rosenkrantz    Ravi Sundaram
    Date  July 1999
    Refs | Theme tree | Cited by 40 |  CiteSeer  

    9) THREE-DIMENSIONAL ALPHA SHAPES  
    By Ernst P Mucke    Herbert Edelsbrunner
    Date  March 1996
    Refs | Theme tree | Cited by 129 |  CiteSeer  

    10) DYNAMIC PROGRAMMING VIA STATIC INCREMENTALIZATION  
    By Scott D. Stoller    Yanhong A. Liu
    Date  January 1970
    Refs | Theme tree | Cited by 23 |  CiteSeer  

    11) EFFICIENT DETECTION OF DETERMINACY RACES IN CILK PROGRAMS  
    By Charles E. Leiserson    Mingdong Feng
    Date  January 1970
    Refs | Theme tree | Cited by 14 |  CiteSeer   (Authority Citation)

    12) IMPLEMENTATIONS OF RANDOMIZED SORTING ON LARGE PARALLEL MACHINES  
    By Jan F. Prins    John H. Reif    William L. Hightower
    Date  April 1995
    Refs | Theme tree | Cited by 32 |  CiteSeer  

    13) NEGATIVE-CYCLE DETECTION ALGORITHMS  
    By Andrew V. Goldberg    Boris V. Cherkassky
    Date  December 1996
    Refs | Theme tree | Cited by 18 |  CiteSeer   (Authority Citation)

    14) APPROXIMATION ALGORITHMS FOR CONNECTED DOMINATING SETS  
    By Samir Khuller    Sudipto Guha
    Date  September 1998
    Refs | Theme tree | Cited by 45 |  CiteSeer  

    15) ROBOT NAVIGATION IN UNKNOWN TERRAINS: INTRODUCTORY SURVEY OF NON-HEURISTIC ALGORITHMS  
    By Nageswara S. V. Rao    S. Sitharama Iyengar    Srikumar Kareti    Weimin Shi
    Date  January 1999
    Refs | Theme tree | Cited by 31 |  CiteSeer  

    16) AN OPTIMAL ALGORITHM FOR APPROXIMATE NEAREST NEIGHBOR SEARCHING IN FIXED DIMENSIONS  
    By Angela Y. Wu    David M. Mount    Nathan S. Netanyahu    Ruth Silverman    Sunil Arya
    Date  July 1998
    Refs | Theme tree | Cited by 185 |  CiteSeer  

    17) COUNTING NETWORKS AND MULTI-PROCESSOR COORDINATION (EXTENDED ABSTRACT)  
    By
    Date  September 1997
    Refs | Theme tree | Cited by 33 |  CiteSeer  

    18) EARLY EXPERIENCES IN EVALUATING THE PARALLEL DISK MODEL WITH THE VIC* IMPLEMENTATION  
    By Melissa Hirschl    Thomas H. Cormen
    Date  January 1970
    Refs | Theme tree | Cited by 20 |  CiteSeer  

    19) EXPERIMENTAL STUDY OF MINIMUM CUT ALGORITHMS  
    By Andrew V. Goldberg    Chandra S. Chekuri    Cliff Stein    David R. Karger    Matthew S. Levine
    Date  October 1996
    Refs | Theme tree | Cited by 20 |  CiteSeer   (Authority Citation)

    20) QOS ROUTING MECHANISMS AND OSPF EXTENSIONS  
    By
    Date  December 1998
    Refs | Theme tree | Cited by 46 |  CiteSeer   (Authority Citation)

    21) A COMBINATORIAL TREATMENT OF BALANCING NETWORKS  
    By
    Date  September 2001
    Refs | Theme tree | Cited by 27 |  CiteSeer  

    22) SET RECONCILIATION WITH NEARLY OPTIMAL COMMUNICATION COMPLEXITY  
    By Ari Trachtenberg    Yaron Minsky
    Date  January 2002
    Refs | Theme tree | Cited by 21 |  CiteSeer  

    23) PERFORMING OUT-OF-CORE FFTS ON PARALLEL DISK SYSTEMS  
    By David M. Nicol    Thomas H. Cormen
    Date  August 1997
    Refs | Theme tree | Cited by 13 |  CiteSeer  

    24) GENERAL PURPOSE PARALLEL COMPUTING  
    By W F Mccoll
    Date  November 1995
    Refs | Theme tree | Cited by 60 |  CiteSeer  

    25) DYNAMIC ALGORITHMS IN COMPUTATIONAL GEOMETRY  
    By Roberto Tamassia    Yi-jen Chiang
    Date  September 1998
    Refs | Theme tree | Cited by 56 |  CiteSeer  

  • Next 25 articles...