Publications

Export 292 results:
Author Title Type [ Year(Asc)]
Filters: First Letter Of Title is F  [Clear All Filters]
1988
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.
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.
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.
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.
1973
Nassi I, Shneiderman B.  1973.  Flowchart techniques for structured programming. ACM SIGPLAN Notices. 8(8):12-26.

Pages