Search

Luther Woodrum Phones & Addresses

  • 14 Seitz Ter, Poughkeepsie, NY 12603 (845) 473-0706 (845) 473-8565
  • 14 Seitz Ter APT 2N, Poughkeepsie, NY 12603 (845) 473-8565

Work

Company: Ibm poughkeepsie 1961 to 1987 Position: Senior programmer

Education

Degree: Bachelors School / High School: Vassar College 1972 to 1977 Specialities: Physics

Skills

Actuarial Mathematics and Statistics • Combinatorial Mathematics • Logical Programming • Stochastic Modelling • Systems Administration • Data Base Indexing • Pattern Matching • Inventing New Algorithms • Unstructured Query Language Optimization • Implementing Array Language Indexing E.g... • Helping People Solve Difficult Problems

Languages

Spanish • Russian

Industries

Computer Software

Resumes

Resumes

Luther Woodrum Photo 1

Chief Executive Officer

View page
Location:
14 Seitz Ter, Poughkeepsie, NY 12603
Industry:
Computer Software
Work:
Ibm Poughkeepsie 1961 - 1987
Senior Programmer

Skyelogic 1961 - 1987
Chief Executive Officer

Cna Insurance 1957 - 1961
Actuarial Programmer
Education:
Vassar College 1972 - 1977
Bachelors, Physics
Syracuse University 1964 - 1971
Ibm System Research Institute 1968 - 1969
Masters, Statistics
Northwestern University 1956 - 1961
University of Chicago 1958 - 1960
Skills:
Actuarial Mathematics and Statistics
Combinatorial Mathematics
Logical Programming
Stochastic Modelling
Systems Administration
Data Base Indexing
Pattern Matching
Inventing New Algorithms
Unstructured Query Language Optimization
Implementing Array Language Indexing E.g. Apl
Helping People Solve Difficult Problems
Languages:
Spanish
Russian

Publications

Us Patents

Binary Tree Flag Bit Arrangement And Partitioning Method And Apparatus

View page
US Patent:
56280025, May 6, 1997
Filed:
Nov 2, 1992
Appl. No.:
7/970399
Inventors:
Luther J. Woodrum - Poughkeepsie NY
International Classification:
G06F 724
US Classification:
395607
Abstract:
Arrangement of fields in binary tree nodes provides a minimal storage encoding storing fixed and variable length keys in factored form in a multilevel tree. A locating method, and apparatus embodying that method, directed by an argument key, which may or may not be stored in the tree, traces a path following arcs upward or downward between nodes in said binary tree, starting from the top node or any other node, until it finds either the argument key or the delta arc where said argument key would be inserted into said tree. The novel binary tree encoding also provides for path tracing starting at a data backpointer field, which allows accessing of neighboring data entries in collating sequence order.

Binary Tree Structure With End Of Path Flags Stored With Path Arc's

View page
US Patent:
62893491, Sep 11, 2001
Filed:
Dec 12, 1996
Appl. No.:
8/767042
Inventors:
Luther J. Woodrum - Poughkeepsie NY
International Classification:
G06F 1730
US Classification:
707100
Abstract:
Arrangement of fields in binary tree nodes provides a minimal storage encoding storing fixed and variable length keys in factored form in a multilevel tree. A locating method, and apparatus embodying that method, directed by an argument key, which may or may not be stored in the tree, traces a path following arcs upward or downward between nodes in said binary tree, starting from the top node or any other node, until it finds either the argument key or the delta arc where said argument key would be inserted into said tree. The novel binary tree encoding also provides for path tracing starting at a data backpointer field, which allows accessing of neighboring data entries in collating sequence order.

Directory Generation System Having Efficiency Increase With Sorted Input

View page
US Patent:
40866289, Apr 25, 1978
Filed:
Nov 12, 1973
Appl. No.:
5/415090
Inventors:
Luther Jay Woodrum - Poughkeepsie NY
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 722
G06F 710
US Classification:
364200
Abstract:
A system tool for electronically generating a machine directory entity having a binary tree relationship. The method generates the directory entity directly from a sequence of input keys without using an intermediate stack. The input key sequence may be sorted or unsorted; but if sorted (whether ascending or descending), the system tool is made more efficient. The directory entity is used by the machine to address objects which may be found within the confines of the machine. Unique connectors called invertible edges, are generated in the machine organization of the directory entity being generated.
Luther J Woodrum from Poughkeepsie, NY, age ~85 Get Report