[Search for users] [Overall Top Noters] [List of all Conferences] [Download this site]

Conference auss::algorithms

Title:ALGORITHMS
Notice:Welcome to ALGORITHMS
Moderator:AUSS::BELL
Created:Fri Jan 27 1995
Last Modified:Tue Jun 03 1997
Last Successful Update:Fri Jun 06 1997
Number of topics:253
Total number of notes:1741

30.0. "Shortest interconnection length" by CSC32::S_ROSCIO (Electrocution Engineering) Wed Jun 07 1989 16:45

T.RTitleUserPersonal
Name
DateLines
30.1exitGAOV08::JCREANThis space intentionally left blankWed Jun 07 1989 17:136
30.2Pseudo points can shorten the pathDECWET::CAPPELLOFBetter living through Chemistry!Wed Jun 07 1989 18:1429
30.3Dumb MST algorithmDECWET::CAPPELLOFBetter living through Chemistry!Wed Jun 07 1989 19:4246
30.4ThxCSC32::S_ROSCIOElectrocution EngineeringWed Jun 07 1989 22:2811
30.5HANNAH::LEICHTERJJerry LeichterThu Jun 08 1989 04:1715
30.6Another referenceCSC32::S_ROSCIOElectrocution EngineeringThu Jun 08 1989 05:407
30.7Not slowDECSIM::GROSSThe bug stops hereThu Jun 08 1989 14:4710
30.8LSMESNELL::KOLTETue Jun 27 1989 02:484
30.9What are they?CSC32::S_ROSCIOElectrocution EngineeringWed Jun 28 1989 18:265
30.10Prim's algorithm; well-defined iteratorsTLE::AMARTINAlan H. MartinMon Jan 01 1990 18:0918
30.12minspan.bliECAD2::FINNERTYWed Jan 10 1990 20:02114
30.13ECAD2::FINNERTYThu Jan 11 1990 14:1826
30.14Base note is ambiguousTLE::AMARTINAlan H. MartinSat Jan 20 1990 19:5716
30.15.12,.13 are best, I thinkDECWET::CAPPELLOFBetter living through Chemistry!Sat Jan 20 1990 21:479
30.16Is Jerry gone or not?DWOVAX::YOUNGIf it bleeds, we can kill it.Sun Jan 21 1990 04:5022
30.17-- right --ECAD2::FINNERTYReach out and luff someoneWed Jan 24 1990 19:117
30.18O(n log n) algorithm for minspan treesECAD2::FINNERTYReach out and luff someoneMon Jan 29 1990 15:5634
30.19kd-tree?CHMIST::cjaBetter living through Chemistry!Mon Jan 29 1990 16:361
30.20kd-treesECAD2::FINNERTYReach out and luff someoneMon Jan 29 1990 21:3431
30.21ALLVAX::ROTHIt's a bush recording...Tue Jan 30 1990 12:5117