| | Books 1 - 10 of 17 | Previous | Next | 

 |  |  | Data Structures and Problem Solving: Walls and Mirrors: Turbo PASCAL (Subsequent Edition) by Frank M. Carrano, Paul Helman, Robert Veroff Hardcover, 715 Pages, Published 1992 by Addison Wesley, Subsequent Edition
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | Science of Database Management by Paul Helman Hardcover, 624 Pages, Published 1993 by McGraw-Hill Education
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | Intermediate Problem-solving and Data Structures: Walls and Mirrors: Modula-2 (Benjamin/Cummings Series in Structured Programming) (Modula-2 Ed Edition) by Paul Helman, Robert Veroff Hardcover, 649 Pages, Published 1988 by Benjamin-Cummings Publishing Co.,Subs. of Addison Wesley Longman,US, Modula-2 Ed Edition
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | Intermediate Problem-solving and Data Structures: Walls and Mirrors by Paul Helman, Robert Veroff Paperback, 612 Pages, Published 1986 by Benjamin-Cummings Publishing Co.,Subs. of Addison Wesley Longman,US
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | The principle of optimality in the design of efficient algorithms (Tech report) by Paul Helman Unknown Binding, 42 Pages, Published 1985 by Dept. of Computer Science, College of Engineering, University of New Mexico
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | A common schema for dynamic programming and branch and bound type algorithms (Tech report) by Paul Helman Unknown Binding, 47 Pages, Published 1986 by Dept. of Computer Science, College of Engineering, University of New Mexico
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | An exact characterization of greedy structures (Tech report) by Paul Helman Unknown Binding, 24 Pages, Published 1989 by Dept. of Computer Science, College of Engineering, University of New Mexico
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | Designing deductive databases (Tech report) by Paul Helman Unknown Binding, 55 Pages, Published 1986 by Dept. of Computer Science, College of Engineering, University of New Mexico
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | An NP-complete data aggregation problem (Tech report) by Paul Helman Unknown Binding, 10 Pages, Published 1984 by Dept. of Computer Science, College of Engineering, University of New Mexico
Compare Prices | Add to Wish List | Set Price Alert | 

 |  |  | A decomposition scheme for combinational circuits (Technical report) by Paul Helman Unknown Binding, Published 1983 by Dept. of Computer Science, College of Engineering, University of New Mexico
Compare Prices | Add to Wish List | Set Price Alert | 

 | | Books 1 - 10 of 17 | Previous | Next |
|