Stanford University. Computer Science Department
Stanford University. Computer Science Dept
Stanford University Computer Science Department academic department at Stanford University
VIAF ID: 149439760 ( Corporate )
Permalink: http://viaf.org/viaf/149439760
Preferred Forms
- 110 2 _ ‡a Stanford University Computer Science Department ‡c academic department at Stanford University
- 110 2 _ ‡a Stanford University ‡b Computer Science Department
- 110 2 _ ‡a Stanford University ‡b Computer Science Department
- 110 2 _ ‡a Stanford University ‡b Computer Science Department
-
- 110 2 _ ‡a Stanford University ‡b Computer Science Dept
- 110 2 _ ‡a Stanford University. Computer Science Dept
- 110 2 _ ‡a Stanford University. ‡b Computer Science Department
-
-
4xx's: Alternate Name Forms (31)
5xx's: Related Names (7)
- 510 2 _ ‡a Stanford University
- 510 2 _ ‡a Stanford University ‡b Computer Science Division ‡4 vorg ‡4 https://d-nb.info/standards/elementset/gnd#precedingCorporateBody ‡e Vorgaenger
- 510 2 _ ‡a Stanford University ‡b Department of Computer Science ‡4 nach ‡4 https://d-nb.info/standards/elementset/gnd#succeedingCorporateBody ‡e Nachfolger
- 510 2 _ ‡a Stanford University ‡b School of Engineering ‡4 adue ‡4 https://d-nb.info/standards/elementset/gnd#hierarchicalSuperiorOfTheCorporateBody ‡e Ueberordnung
- 510 2 _ ‡a Stanford University ‡b School of Humanities and Sciences ‡4 adue ‡4 https://d-nb.info/standards/elementset/gnd#hierarchicalSuperiorOfTheCorporateBody ‡e Ueberordnung
- 510 2 _ ‡a Stanford University ‡4 adue ‡4 https://d-nb.info/standards/elementset/gnd#hierarchicalSuperiorOfTheCorporateBody ‡e Ueberordnung
- 551 _ _ ‡a Stanford, Calif. ‡4 orta ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBusiness
Works
Title | Sources |
---|---|
Aggressive transmissions over redundant paths for time critical messages | |
Bibliography of computer science reports | |
Book review : Flow algorithms by G.M. Adelʹson-Velʹski, E.A. Dinic, and A.V. Karzanov | |
Computation and action under bounded resources | |
The dependence graph for bases in matroids | |
Dynamics for robot control : friction modeling and ensuring excitation during parameter identification | |
Exploiting recursion to simplify RPC communication architectures | |
Generalized Voronoi diagrams and geometric searching | |
Generation of model-based knowledge-acquisition tools for clinical-trial advice systems | |
Instantaneous robot motion with contact between surfaces | |
A lower bound for radio broadcast | |
Mathematical writing | |
Model formulation for physics problem solving, 1982: | |
Multiprocessor smalltalk : implementation, performance, and analysis | |
New computing environments : parallel, vector and systolic | |
On "PASCAL," code generation, and the CDC 6000 computer. | |
On the semantics of temporal logic programming (preliminary report) | |
Overview of multidatabase transaction management | |
Parallel processing and medium-scale multiprocessors | |
Performance of inverted indices in distributed text document retrieval systems | |
Proceedings from the ... annual Meeting of the Stanford Computer Forum. | |
Projections of vector addition system reachability sets are semilinear | |
Proving termination properties of PROLOG programs : a semantic approach | |
Rep. - Stanford Univ., Dept. Comput. Sci. | |
Report. | |
Shellsort and sorting networks | |
Some basic machine algorithms for integral order computations. | |
STAN-CS | |
The unified management of memory in the V distributed system | |
A unified system of parameterization for programming languages |