HOME QUICK SEARCH AUTHORS KEYWORDS HELP BUGS

Paul M. Dorfman

89 papers and 1 presentation; 75 titles; 15 coauthors.

Back to authors

Conference × Year × Title × Co-authors Extras Pages
WUSS 2024 Array Hashing: Simple, Fast, and Efficient source 12
WUSS 2024 Uniform Hashing of Arbitrary Input Into Key-Exclusive Segments Donald J. Henderson source 17
SESUG 2023 Hashes From The Ashes Richard A. DeVenezia source 14
SESUG 2022 Array Searching Algorithms and Techniques source 15
SGF 2021 Uniform Hashing of Arbitrary Input Into Key-Exclusive Segments Donald J. Henderson source
presentation		 17
SGF 2020 Dynamic Programming With The SAS Hash Object source 23
SGF 2019 Re-Mapping a Bitmap Lessia S. Shajenko source 33
SGF 2019 The SAS Hash Object: Well Beyond Table Lookup Donald J. Henderson source 27
SESUG 2018 Efficient DATA Step Random Sampling Out Of Thin Air source 16
SESUG 2018 How To Dupe A Dedup source 7
SESUG 2018 Sorting Arrays Using the Hash Object source 17
SGF 2018 Efficient Elimination of Duplicate Data Using the MODIFY Statement source 7
SGF 2018 Key-Independent Uniform Segmentation of Arbitrary Input Using a Hash Function Donald J. Henderson source 18
SGF 2017 Beyond Table Lookup: The Versatile SAS Hash Object Donald J. Henderson source 27
SESUG 2016 Fundamentals of the The SAS Hash Object source 23
SGF 2016 Using the SAS Hash Object with Duplicate Key Entries source
zip		 16
SESUG 2015 How to DoW source 12
SESUG 2015 Using the SAS Hash Object with Duplicate Key Entries source 16
SGF 2015 Data Aggregation Using the SAS Hash Object Donald J. Henderson source 20
SESUG 2014 The DoW-Loop Lessia S. Shajenko source 12
WUSS 2014 The SAS Hash Object in Action source 29
SGF 2014 Detecting Patterns Using Geo-Temporal Analysis Techniques in Big Data [presentation] Richard W. La Valley,
Abraham Usher,
Donald J. Henderson		 source 1
SGF 2014 Direct Memory Data Management Using the APP Tools source 18
SESUG 2013 HOW to DOW source 12
SGF 2013 The Magnificent DO source 15
SESUG 2012 The ADDR-PEEK-POKE Capsule: Transporting Data Within Memory and Between Memory and the PDV source 18
SESUG 2012 Through the DoW-Loop, One Statement at a Time source 12
SGF 2012 HOW to DOW Lessia S. Shajenko source 12
SGF 2012 Straight from Memory: ADDR, PEEK, POKE as SAS Programming Tools William W. Viergever source 18
SESUG 2011 From Obscurity to Utility: ADDR, PEEK, POKE as DATA Step Programming Tools Lessia S. Shajenko source 18
SESUG 2011 In Lockstep with the DoW-Loop Lessia S. Shajenko source 18
SESUG 2011 Two Guys On Hash source 34
NESUG 2011 Hash + Point = Key Lessia S. Shajenko 13
NESUG 2010 Black Belt Hashigana Marina Fridman 29
NESUG 2010 HOW to DOW 18
SESUG 2010 The DOW-Loop Unrolled source 15
SESUG 2010 Two Guys On Hash source 33
SGF 2010 Black Belt Hashigana Koen Vyverman,
Victor P. Dorfman		 source 29
SGF 2010 The French Connection: Implementing a RAID Controller Algorithm in Base SAS Koen Vyverman source 18
SESUG 2009 From Obscurity to Utility: ADDR, PEEK, POKE as DATA Step Programming Tools source 21
SESUG 2009 The SAS Hash Object in Action source 30
NESUG 2009 The DOW-Loop Unrolled Marina Fridman 18
NESUG 2009 The SAS Hash Object in Action Marina Fridman,
Koen Vyverman		 26
SGF 2009 From Obscurity to Utility: ADDR, PEEK, POKE as DATA Step Programming Tools source 20
SGF 2009 The DOW-Loop Unrolled Koen Vyverman source 18
SGF 2009 The SAS Hash Object in Action Koen Vyverman source 26
SESUG 2008 The DOW-Loop Unrolled Lessia S. Shajenko source 19
NESUG 2008 From Obscurity to Utility: ADDR, PEEK, POKE as DATA Step Programming Tools 19
NESUG 2008 The DOW-Loop Unrolled 18
PharmaSUG 2008 The DOW-Loop Unrolled Lessia S. Shajenko 18
SGF 2008 Hash Crash and Beyond Lessia S. Shajenko,
Koen Vyverman		 source 24
NESUG 2007 From Obscurity to Utility: ADDR, PEEK, POKE as DATA Step Programming Tools Lessia S. Shajenko 20
NESUG 2007 Hash Crash and Beyond Lessia S. Shajenko 25
SESUG 2007 Data Step Hash Objects as Programming Tools Lessia S. Shajenko source 21
SESUG 2007 The DOW-Loop Unrolled Lessia S. Shajenko source 18
NESUG 2006 DATA Step Hash Objects and How to Use Them Lessia S. Shajenko 21
NESUG 2006 Need a Speedy Index? RAM It! Lessia S. Shajenko 14
SUGI 2006 Crafting Your Own Index: Why, When, How Lessia S. Shajenko source 14
SUGI 2006 Data Step Hash Objects as Programming Tools Koen Vyverman source 21
SESUG 2005 Manipulating Data: Elements of the DATA Step Language source 19
NESUG 2005 Crafting Your Own Index: Why, When, How Lessia S. Shajenko 10
SUGI 2005 Data Step Hash Objects as Programming Tools Koen Vyverman source 21
NESUG 2004 Data Step Programming Using the Hash Objects Lessia S. Shajenko 17
SESUG 2004 Fresh SAS Programming Tunes from Hashville Alexander A. Martchenko source 17
SUGI 2004 A-P-P Advanced Data Management Functions Peter Crawford source 20
SUGI 2004 Hash Component Objects: Dynamic Data Storage and Table Look-Up Koen Vyverman source 18
SESUG 2003 Table Lookup By Direct Addressing: From V8 To V9 source 13
NESUG 2003 Table Lookup By Direct Addressing: From V8 To V9 14
SUGI 2003 Hashing: Generations Gregg P. Snell source 10
NESUG 2002 An Animated Guide: Speed Merges with Key Indexing, Bitmapping and Hashing Russell M. Lavery 10
SESUG 2002 The Magnificent DO source 10
SUGI 2002 Hashing Rehashed Gregg P. Snell source 9
SESUG 2001 A Couple of Tasty SAS Programming Tunes source 9
SESUG 2001 Direct Addressing Techniques of Table Look-Up Part 1. Key-Indexing - Bitmapping Part 2. Hashing source 10
SESUG 2001 Manipulating Data: Elements of the DATA Step Language source 10
SCSUG 2001 A Couple of Tasty SAS Programming Tunes 9
SCSUG 2001 Direct Addressing Techniques of Table Look-Up Part 1. Key-Indexing - Bitmapping Part 2. Hashing 10
SCSUG 2001 Manipulating Data: Elements of the DATA Step Language 10
SUGI 2001 Quick Disk Table Look-up via Hybrid Indexing into a Directly Addressed SAS Data Set source 6
SUGI 2001 Quick Sorting an Array source 6
SUGI 2001 Table Look-Up by Direct Addressing: Key-Indexing - Bitmapping - Hashing source 10
SESUG 2000 Introduction in Efficient SAS Programming via Incremental Refinement by Example source 8
SESUG 2000 Organizing Ultra-Quick Disk Table Lookup via Hybrid Indexing Into a Directly Addressed SAS Data Set source 6
SESUG 2000 Panel Discussion on Problem Solving Frank C. DiIorio,
H. Ian Whitlock		 source 21
SESUG 2000 Table Lookup via Direct Addressing: Key-Indexing, Bitmapping, Hashing source 11
SUGI 2000 Private Detectives in a Data Warehouse: Key-Indexing, Bitmapping, and Hashing source 10
SESUG 1999 Array Lookup Techniques: from Key-Indexing to Hashing (Part 2) source 11
SESUG 1999 Array Lookup Techniques: from Sequential Search to Key-Indexing (Part 1) source 11
SUGI 1999 Alternative Approach to Sorting Arrays and Strings: Tuned DATA Step Implementations of Quicksort and Distribution Counting source 6
SESUG 1998 Building Macro-based Data Step Functions Using Random Macro Aliases to Simulate Local Scope of Internal Function Variables 4

Back to authors