Publications

Export 292 results:
Author Title Type [ Year(Desc)]
Filters: First Letter Of Title is F  [Clear All Filters]
1973
Nassi I, Shneiderman B.  1973.  Flowchart techniques for structured programming. ACM SIGPLAN Notices. 8(8):12-26.
1976
Agrawala AK, Rauscher TG.  1976.  Foundations of microprogramming: architecture, software, and applications.
1981
Shiloach Y, Vishkin U.  1981.  Finding the maximum, merging, and sorting in a parallel computation model. Journal of Algorithms. 2(1):88-102.
1982
Shneiderman B.  1982.  Fighting for the User.. Bulletin of the American Society for Information ScienceBulletin of the American Society for Information Science. 9(2):27-29.
Shneiderman B.  1982.  The future of interactive systems and the emergence of direct manipulation. Behaviour & Information Technology. 1(3):237-256.
1984
Vishkin RETU.  1984.  Finding biconnected components and computing tree functions in logarithmic parallel time. 1998 International Conference on Parallel Architectures and Compilation Techniques, Paris, France, October 12-18, 1998: proceedings. :12-12.
Atallah M, Vishkin U.  1984.  Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.
Roussopoulos N, Mark L.  1984.  A framework for self-describing and self-documenting database systems. NBS Trends and Application Conference.
1985
Mount D.  1985.  On Finding Shortest Paths on Convex Polyhedra..
Reggia JA, Nau DS, Wang P, Peng Y.  1985.  A formal model of abductive inference. Information Sciences. 37:227-285.
Reggia JA, Nau DS, Wang PY, Peng Y.  1985.  A formal model of diagnostic inference, II. Algorithmic solution and application. Information Sciences. 37(1-3):257-285.
1987
O'Leary DP.  1987.  Fine and Medium Grained Parallel Algorithms for Matrix QR Factorization. Algorithms and Applications on Vector and Parallel ComputersAlgorithms and Applications on Vector and Parallel Computers. :347-349.
O'Leary DP, Stewart G.W.  1987.  From Determinacy to Systaltic Arrays. Computers, IEEE Transactions on. C-36(11):1355-1359.
1988
Landau GM, Vishkin U.  1988.  Fast string matching with k differences.. J. COMP. SYST. SCI.. 37(1):63-78.
Landau GM, Vishkin U.  1988.  Fast string matching with k differences* 1,* 2. Journal of Computer and System Sciences. 37(1):63-78.
Megiddo N, Vishkin U.  1988.  On finding a minimum dominating set in a tournament. Theoretical Computer Science. 61(2-3):307-316.
Marchionini G, Shneiderman B.  1988.  Finding facts vs. browsing knowledge in hypertext systems. Computer. 21(1):70-80.
Schieber B, Vishkin U.  1988.  On finding lowest common ancestors: simplification and parallelization. VLSI Algorithms and Architectures. :111-123.
1989
Landau GM, Vishkin U.  1989.  Fast parallel and serial approximate string matching* 1. Journal of Algorithms. 10(2):157-169.
Cole R, Vishkin U.  1989.  Faster optimal parallel prefix sums and list ranking. Information and Computation. 81(3):334-352.
Chan TF, Elman H.  1989.  Fourier Analysis of Iterative Methods for Elliptic Problems. SIAM Review. 31(1):20-49.
Chang AE, Steinberg SM, Culnane M, Lampert MH, Reggia JA, Simpson CG, Hicks JE, White DE, Yang JJ, Glatstein E.  1989.  Functional and psychosocial effects of multimodality limb-sparing therapy in patients with soft tissue sarcomas. Journal of Clinical Oncology. 7(9):1217-1217.
1990
Landau GM, Vishkin U, Nussinov R.  1990.  Fast alignment of DNA and protein sequences. Methods in enzymology. 183:487-502.
Schieber B, Vishkin U.  1990.  Finding all nearest neighbors for convex polygons in parallel: a new lower bound technique and a matching algorithm. Discrete Applied Mathematics. 29(1):97-111.
Kreitzberg CB, Shneiderman B.  1990.  FORTRAN Programming: A Spiral Approach.

Pages