Algorithms for finding clique-transversals of graphs
Durán, Guillermo ; Lin, Min Chih ; Mera, Sergio ; Szwarcfiter, Jayme L.
2008.

Algorithms for finding conserved regions in DNA sequences: a phylogenetic approach
Elias, Isaac
Stockholm, . 2002. 42 s..

Algorithms for finding the shortest path through a 3D finite element model.
Nordström, Michael
1998. 53 s..

Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
Jungwattanakit, Jitti ; Reodecha, Manop ; Werner, Frank
Magdeburg. Univ.. 2006. 13 S.. Preprint ; 2006,26.

Algorithms for forming part-families and their assignment to machines in group technology/ Tom An Liu
Liu, Tom An
Ann Arbor. University Microfilms Int./UMI. 1992. 122 S..
ISBN 0-315-72434-X

ALGORITHMS FOR GAMES
ADELSON-VELSKY
1988.

Algorithms for geometric tolerance assessment
Butler, B. P. ; Forbes, A. B. ; Harris, P. M.
Teddington. National Physical Laboratory. 1994. 44 S.. NPL report : DITC ; 228.

ALGORITHMS FOR GRAPHICS AND I
PAVLIDIS
1982.

Algorithms for graphics and image processing
Pavlidis, Theodosios
5. print.. Rockville, Md.. Computer Science Press. [19]86. XV, 416 S. : Ill., graph. Darst..
ISBN 0-914894-65-X

Algorithms for graphs of small treewidth
Fluiter, Babette Lucie Elisabeth de
Utrecht. Universiteit. 1997. IV, 246 S..
ISBN 90-393-1528-0

Algorithms for health planners
Harris, L. Jeff.
Santa Monica, CA. Rand,. 1977.. 6 v..

Algorithms for image processing and computer vision
Parker, James R.
1 Aufl.. New York [u.a.]. Wiley. 1997. XIII, 417 S. : Ill., graph. Darst.. Wiley computer publishing.
ISBN 0-471-14056-2

Algorithms for incompletely specified distributions in a generalized graph model for medical diagnosis
Lemmer, J.F.
College Park - Md. . 1976. 4 Microfiches..

Algorithms for integrated circuit layout: an analysis approach
LaPaugh, Andrea S.
1980. 1 Mikrofilm : 35 mm.

Algorithms for integrated circuit layout: an analytic approach
LaPaugh, Andrea Suzanne.
Cambridge. Massachusetts Institute of Technology, Laboratory for Computer Science,. 1980.. 175 p..

Algorithms for integrated circuit signal routing
Baratz, Alan E.
c1981.. 116 leaves.

Algorithms for interpolation of sparse rational functions using polynomial number of evaluations
Chistov, Aleksandr L. ; Karpinski, Marek
Bonn. Inst. für Informatik. 1995. 23 Bl.. Research report / Institut für Informatik der Universität Bonn ; 85142 : CS.
geh.

Algorithms for ion current based sensing of combustion variability and pressure peak position
Byttner, Stefan,
Göteborg. Chalmers tekniska högsk.,. 2003. 43 s..

ALGORITHMS FOR JORDAN CURVES ON COMPACT SURFACES. VON BRUCE L. REINHART
Reinhart, Bruce L.
BALTIMORE, MD.. RIAS. 1960. 18 S.. AIR FORCE OFFICE OF SCIENTIFIC RESEARCH: TECHNICAL REPORT. 60,21..

Algorithms for Knapsack problems
Pisinger, David
Copenhagen. Univ., Dep. of Computer Science. 1995. 199 S.. Datalogisk Institut «København»: DIKU-Rapport ; 1995,1.

Algorithms for large scale linear algebraic systems: applications in science and engineering
Winter Althaus, G. ; Spedicato, E.
Dordrecht ; . Kluwer Academic Publishers,. c1998.. viii, 409 p. ;.

Algorithms for least squares problems with banded inequality constraints
Eldén, Lars
Linköping. Dept. of Mathematics, Univ.. 1977. 56 S.. Report LiTH MAT R ; 77,20.
ISBN 91-7372-178-6

Algorithms for linear-quadratic optimization
Sima, Vasile
New York, NY [u.a.]. Dekker. 1996. VII, 366 S.. Pure and applied mathematics ; 200.
ISBN 0-8247-9612-8 pbk. : alk. paper

Algorithms for matrix multiplication
Brent, R. P.
Stanford. Univ.. 1970. II, 52 S.. Report / Computer Science Department ; Stan-CS-70-157.

Algorithms for mean risk stochastic integer programs in energy
Schultz, Rüdiger ; Neise, Frederike
Duisburg. 2005. [4] Bl. : graph. Darst.. Schriftenreihe des Fachbereichs Mathematik / Universität Duisburg-Essen ; 615.

Algorithms for memory hierarchie Insurance Co.]
Meyer, Ulrich, ; Sanders, Peter, ; Sibeyn, Jop.
[1980]. 24 S..

Algorithms for memory hierarchies: advanced lectures
Meyer, Ulrich, ; Sanders, Peter, ; Sibeyn, Jop.
Berlin ; . Springer,. 2003.. xvii, 428 p..

Algorithms for minimization without derivatives
Brent, Richard Peirce
Englewood Cliffs, NJ. Prentice-Hall. 1972. XII, 195 S.. Prentice-Hall series in automatic computation.
ISBN 0-13-022335-2

Algorithms for minimization without derivatives
Brent, Richard P.
Unabridged republication of the work publ. by Prentice-Hall ... 1973. Mineola, NY. Dover Publications. 2002. X, 195 S..
ISBN 0-486-41998-3 pbk.

Algorithms for modeling anatomic and target volumes in image-guided neurosurgery and radiotherapy
Alakuijala, Jyrki
Oulu. Oulun Yliopisto. 2001. Getr. Zählung [ca. 180 S.]. Acta Universtatis Ouluensis : C, Technica ; 165.
ISBN 951-42-6573-4

Algorithms for modular elliptic curves
Cremona, J. E.
2. ed. Cambridge [u.a.]: Cambridge Univ. Press. 1997. 376 S..
ISBN 0-521-59820-6 : £45.00

Algorithms for modular elliptic curves
Cremona, J. E.
Cambridge. Cambridge University Press. 1992. 343 S..
ISBN 0-521-41813-5

Algorithms for molecular biology
[London]. BioMed Central,. c2006-.

Algorithms for monotonic functions
Bayes, Tony
[Canberra]. 1989. 10 S. : graph. Darst. Working paper : Centre for Resource and Environmental Studies, the Australian National University ; 1989,2.
ISBN 0-86740-351-9

Algorithms for multi-adaptive time-stepping
Jansson, Johan ; Logg, Anders,
Göteborg. Chalmers Finite Element Centre, Chalmers University of Technology,. 2004. 22 s..

Algorithms for multicovering models with application to line planning
Sieg, Simone
2003. 105 Bl. : Ill., graph. Darst..

Algorithms for multispectral and hyperspectral imagery: 5 April 1994, Orlando, Florida
Iverson, A. E. [Hrsg.]
Bellingham, Wash.. SPIE. 1994. V, 200 S.. SPIE proceedings series ; 2231.
ISBN 0-8194-1535-9

Algorithms for multispectral and hyperspectral imagery II: 9-11 April 1996, Orlando, Florida
Iverson, A. Evan
Bellingham, Wash.. SPIE. 1996. VII, 402 S.. SPIE proceedings series ; 2758.
ISBN 0-8194-2139-1

Algorithms for multispectral and hyperspectral imagery III: 22-23 April 1997, Orlando, Florida
Iverson, A. Evan
Bellingham, Wash.. SPIE. 1997. VII, 260 S.. SPIE proceedings series ; 3071.
ISBN 0-8194-2486-2

Algorithms for multispectral and hyperspectral imagery IV: 13-14 April 1998, Orlando, Florida
Shen, Sylvia S.
Bellingham, Wash.. SPIE. 1998. VII, 250 S.. SPIE proceedings series ; 3372.
ISBN 0-8194-2821-3

Algorithms for multispectral and hyperspectral imagery V
Shen, Sylvia S.
Bellingham, Wash.. SPIE. 1999. V, 206 S.. SPIE proceedings series ; 3717.
ISBN 0-8194-3191-5

Algorithms for multispectral, hyperspectral, and ultraspectral imagery VI: 24 - 26 April 2000, Orlando, USA
Shen, Sylvia S.
Bellingham, Wash.. SPIE, the International Society for Optical Engineering. 2000. X, 534 S.. SPIE proceedings series ; 4049.
ISBN 0-8194-3675-5

Algorithms for multispectral, hyperspectral, and ultraspectral imagery VII: 16 - 19 April 2001, Orlando, USA
Shen, Sylvia S.
Bellingham, Wash.. SPIE. 2001. X, 600 S.. SPIE proceedings series ; 4381.
ISBN 0-8194-4076-0

Algorithms for mutual exclusion
Raynal, M.
London. North Oxford Academic. 1986. XIV, 107 S..
ISBN 0-946536-04-X

Algorithms for navigation of autonomous guided vehicles: based on measurements of directions to identical beacons
Wiklund, Urban
Lule¯, . 1988.

Algorithms for network programming
Kennington, Jeff L. ; Helgason, Richard V.
New York [u.a.]. Wiley. 1980. XIII, 291 S.. A Wiley-Interscience publication.
ISBN 0-471-06016-X

Algorithms for nonlinear programming and multiple objective decisions
Rustem, Berç
Chichester [u.a.]. Wiley. 1998. XVI, 304 S. : graph. Darst.. Wiley interscience series in systems and optimization.
ISBN 0-471-97850-7

ALGORITHMS FOR OPERATIONS WITH WHOLE NUMBERS
4. PRINT.. WASHINGTON, D. C.. NATIONAL COUNCIL OF TEACHERS OF MATHEMATICS. 1968. IV, 33 S. : ILL., TAB.. TOPICS IN MATHEMATICS FOR ELEMENTARY SCHOOL TEACHERS ; BOOKLET NO. 4.

Algorithms for optimal design
Gaffke, Norbert ; Heiligers, Berthold
Augsburg. Inst. für Mathematik. 1995. 5 Bl.. Report / Universität Augsburg, Institut für Mathematik ; 319.

Algorithms for optimising of supply chains at TRW Automotive
Kolesnyk, Viktor
2004. 74 Bl. : graph. Darst..

Algorithms for parallel polygon rendering
Theoharis, Theoharis
Berlin [u.a.]. Springer. 1989. VII, 147 S.. Lecture notes in computer science ; 373.
ISBN 3-540-51394-9

Algorithms for parallel processing: [proceedings of a workshop that was inteeokassette$$b(60 Min.)
Heath, Michael T.
Archimède.

Algorithms for parallel processing
Heath, Michael T. ; Ranade, Abhiram. ; Schreiber, Robert S.
New York. Springer,. c1999.. x, 366 p..

Algorithms for polynomials over a real algebraic number field
Rubald, C.M.
Madison - Wisc. . 1973. 12 Microfiches..

Algorithms for portfolio optimization and portfolio insurance
Rudolf, Markus
Bern ¬[u.a.]¬. Haupt. 1994. 201 S. : graph. Darst..

Algorithms for process modelling using fuzzy neural networks
Ikonen, Enso
Oulu. Oulun Yliopisto. 1996. 135 S.. Acta Universtatis Ouluensis : C, Technica ; 95.
ISBN 951-42-4486-9

Algorithms for projection methods for solving linear systems of equations
Wainwright, R.L.
Ames - Io. . 1974. 7 Microfiches..

Algorithms for proximity problems on colored point sets
Graf, T. ; Hinrichs, K.
Münster. Inst. f. Numer. Math., Univ.. 1992. 16 S.. Preprints / Angewandte Mathematik und Informatik ; 1992,18-I.

Algorithms for psychrometric calculations (skeleton tables for the thermodynamic properties of moist air)
Kusuda, Tamami.
Washington, . U.S. National Bureau of Standards; for sale by the Supt. of Docs., U.S. Govt. Print. Off.,. 1970.. iii, 50 p..

Algorithms for random generation and counting: a markov chain approach
Sinclair, Alistair
Boston [u.a.]. Birkhäuser. 1993. 146 S. : graph. Darst.. Progress in theoretical computer science.
ISBN 0-8176-3658-7

Algorithms for random graphs with bounded degree
Baliânska, Krystyna Teresa.
Poznaân. Wydawn. Politechniki Poznaânskiej,. 1996.. 162, [1] p..

Algorithms for reachability problems
Szolnoki, Dietmar
Aachen. Shaker. 2001. 88 S.. Berichte aus der Mathematik.
ISBN 3-8265-8747-2 Pb. : DM 79.00, sfr 79.00, S 549.00

Algorithms for reflecting rays from general topographic surfaces in a ray tracing program
Jones, R. Michael
Boulder, Colo.. U.S. Dept. of Commerce, National Oceanic and Atmospheric Administration, Environmental Research Laboratories,. [1982]. v, 58 p..

Algorithms for reverse convex programs
Gurlitz, Thomas Richard,
1985.. xi, 114 leaves.

Algorithms for robotic motion and manipulation: 1996 Workshop on the Algorithmic Foundations of Robotics, [held in July 1996 in Toulouse, France]
Laumond, Jean-Paul
Wellesley, Mass.. Peters. 1997. XII, 468 S..
ISBN 1-568-81067-9

Algorithms for routing and scheduling in demand responsive transportation systems
Howson, Larry L. ; Heathington, Kenneth W.
Warren, Mich.. Research Laboratories, General Motors Corporation,. 1970.. ii, 23 leaves ;.

Algorithms for routing in planar graphs
Becker, M. ; Mehlhorn, Kurt
Saarbruecken. Univ. d. Saarlandes, Fachbereich 10. 1984. 24 Bl.. [Bericht] / Sonderforschungsbereich 124 ; 12/84.

Algorithms for routing on meshes
Sibeyn, Jop Frederik
1992. 177 S..
ISBN 90-393-0304-5

Algorithms for RPN calculators
Ball, John A.
New York [u.a.]. Wiley. 1978. XII, 330 S.. A Wiley-Interscience publication.
ISBN 0-471-03070-8

Algorithms for scheduling tasks with input error and end-to-end deadlines
Feng, W. ; Liu, J. W.-S.
Urbana, Ill.. Univ. of Ill., Dep. of Computer Science. 1994. 30 Bl.. UIUCDCS R ; 1888.

Algorithms for sensitivity and error analysis of combined estimat1. Conclusion (S. 201) -- Appendix (S. 217) -- References (S. 219) -- Character List (S. 229) -- Index (S. 237).
Carlock, Gaylord Wayne
ISBN 0-8047-4111-5

Algorithms for sensor and ad hoc networks: advanced lectures
Wagner, Dorothea
Berlin [u.a.9. Springer. 2007. XIII, 415 S.. Lecture Notes in Computer Science ; 4621 : Tutorial.
978-3-540-74990-5 |b Pb. : EUR 51.36 (freier Pr.), sfr 84.00 (freier Pr.)

Algorithms for sensor and ad hoc networks: advanced lectures
Wagner, Dorothea ; Wattenhofer, Roger
1. Aufl. München. Hut. 2006. XI, 177 S.. Fahrzeugtechnik.
ISBN 3-89963-435-7 Pb. : EUR 39.00

Algorithms for separable nonlinear least square problems
Ruhe, A. ; Wedin, P.
1974. 47 S.. Reports ; STAN-CS-74-434.

Algorithms for separation of secondary surveillance radar replies
Petrochilos, Nicolas Laurent Regis
Delft. DUP Science. 2002. XII, 157 S..
ISBN 90-407-2371-0

Algorithms for short-term production-planningc of cogeneration plants
Dotzauer, Erik,
Linköping. Univ.,. 1997. 85 s..

Algorithms for site selection in distributed query processing
Martin, T. P. ; Lam, Kin H.
Kingston. Dept., Univ.. 1988. 13 S.. Technical report. Department of Computing and Information Science. Queens University ; 240.

Algorithms for soft-decision decoding of block codes by approximation of Voronoi regions
Butovitsch, Peter,
Stockholm, . 1992. 35 s..

Algorithms for soft handoff evaluation and soft handoff power control.
Andersson, Andreas
1998. 62 bl..

Algorithms for solving dynamic models with occasionally binding constraints
Christiano, Lawrence J. ; Fisher, Jonas Daniel Maurice
London, Ontario. 1994. 45, [9] S. : graph. Darst. Research report : Department of Economics, Social Science Centre, University of Western Ontario ; 9404.
ISBN 0-7714-1631-8

Algorithms for solving nonlinear programming problems with noisy data
Hintermüller, Michael
Linz. Trauner. 1998. VI, IV, 224 S.. Schriften der Johannes-Kepler-Universität Linz : Reihe C, Technik und Naturwissenschaften ; 23.
ISBN 3-85320-925-4

Algorithms for solving the four point motion problem in computer vision
Philip, Johan
Stockholm. Royal Institute of Technology. 2003. 11 S.. TRITA-MATT : MA ; 2003,20.

Algorithms for solving the single-sink fixed-charge transportation problem
Klose, Andreas
2008.

Algorithms for some center problems on networks
Hämäläinen, Pentti
Jyväskylä. Jyväskylän Yliopisto. 1984. 137 S.. Jyväskylä studies in computer science, economics and statistics ; 6.
ISBN 951-679-121-2

Algorithms for some design automation problems
Cohoon, James P.
Ann Arbor, Mich.. UMI Research Pr.. 1985. VIII,104 S.. Computer Science. Computer Architecture and Design ; 3.
ISBN 0-8357-1615-5

Algorithms for sparse matrix eigenvalue problems
Lewis, John G.
Stanford, Calif.. Stanford Univ.. 1977. [3 Microfiches]. Computer Science Department ; Stan-CS-77-595.

Algorithms for speech coding systems based on linear prediction
Rooijackers, J. E.
Eindhoven. Univ. of Technology. 1992. VII, 86 S.. EUT Report 92,E,260.
ISBN 90-6144-260-5

Algorithms for statistical signal processing
Proakis, John G.
Upper Saddle River, NJ. Prentice Hall. 2002. XII, 564 S..
ISBN 0-13-062219-2

Algorithms for synthesis and testing of asynchronous circuits
Lavagno, Luciano ; Sangiovanni-Vincentelli, Alberto
Boston [u.a.]. Kluwer. 1993. XVIII, 339 S.. The Kluwer international series in engineering and computer science ; 232 : VLSI, computer architecture and digital signal processing.
ISBN 0-7923-9364-3 alk. paper

Algorithms for synthetic aperture radar imagery: 6 - 7 April 1994, Orlando, Fla.
Giglio, Dominick A. ¬[Hrsg.]¬
Bellingham, Wash.. 1994. VII, 420 S. : Ill., graph. Darst.. Proceedings / SPIE ; 2230.
ISBN 0-8194-1534-0

Algorithms for synthetic aperture radar imagery II: 19 - 21 April 1995, Orlando, Florida
Giglio, Dominick A.
Bellingham, Wash.. SPIE, the International Society for Optical Engineering. 1995. VII, 452 S.. SPIE proceedings series ; 2487.
ISBN 0-8194-1840-4

Algorithms for synthetic aperture radar imagery III: 10 - 12 April 1996, Orlando, Florida
Zelnio, Edmund G.
Bellingham, Wash.. SPIE, the International Society for Optical Engineering. 1996. VII, 452 S.. SPIE proceedings series ; 2757.
ISBN 0-8194-2138-3

Algorithms for synthetic aperture radar imagery IV: 23-24 April [1997], Orlando, Florida
Zelnio, Edmund G.
Bellingham, Wash.. SPIE, the International Society for Optical Engineering. 1997. VII, 426 S.. SPIE proceedings series ; 3070.
ISBN 0-8194-2485-4

Algorithms for synthetic aperture radar imagery IX: 1 - 2 April 2002, Orlando, USA
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 2002. VII, 330 S.. SPIE proceedings series ; 4727.
ISBN 0-8194-4477-4

Algorithms for synthetic aperture radar imagery V: 14 - 17 April 1998, Orlando, Florida
Zelnio, Edmund G.
Bellingham, Wash.. SPIE, the International Society for Optical Engineering. 1998. X, 688 S.. SPIE proceedings series ; 3370.
ISBN 0-8194-2819-1

Algorithms for synthetic aperture radar imagery VI: 5 - 9 April 1999, Orlando, Florida
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 1999. X, 830 S.. SPIE proceedings series ; 3721.
ISBN 0-8194-3195-8

Algorithms for synthetic aperture radar imagery VII: 24 - 28 April 2000, Orlando, USA
Zelnio, Edmund G.
Berlin. Verein Berlinische Galerie,. cop. 1994. 136 s..

Algorithms for synthetic aperture radar imagery VII: 24 - 28 April 2000, Orlando, USA
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 2000. X, 724 S.. SPIE proceedings series ; 4053.
ISBN 0-8194-3679-8

Algorithms for synthetic aperture radar imagery VIII: 16 - 19 April 2001, Orlando, USA
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 2001. VIII, 442 S.. SPIE proceedings series ; 4382.
ISBN 0-8194-4077-9

Algorithms for synthetic aperture radar imagery X: 21 - 23 April 2003, Orlando, Florida, USA
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 2003. VIII, 410 S.. SPIE proceedings series ; 5095.
ISBN 0-8194-4955-5

Algorithms for synthetic aperture radar imagery XI: 12 - 15 April 2004, Orlando, Florida, USA
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 2004. VIII, 472 S.. SPIE proceedings series ; 5427.
ISBN 0-8194-5350-1

Algorithms for synthetic aperture radar imagery XII: 28 - 31 March 2005, Orlando, Florida, USA
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 2005. VIII, 470 S.. Proceedings of SPIE ; 5808.
ISBN 0-8194-5793-0

Algorithms for synthetic aperture radar imagery XIV: 10 - 11 April 2007, Orlando, Florida, USA
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 2007. Getr. Zählung [ca. 320 S.]. Proceedings of SPIE ; 6568.
ISBN 978-0-8194-6690-7

Algorithms for synthetic aperture radar imagery XV: 17 - 18 March 2008, Orlando, Florida, USA
Zelnio, Edmund G.
Bellingham, Wash.. SPIE. 2008. Getr. Zählung [ca. 300 S.]. Proceedings of SPIE ; 6970.
ISBN 978-0-8194-7161-1

Algorithms for sysnthesis and testing of asynchronous circuits
Lavagno, Luciano ; Sangiovanni-Vincentelli, Alberto
2. printing. Boston [u.a.]. Kluwer. 1996. X, 338 S.. TheKluwer international series in engineering and computer science ; 232 : VLSI, computer architecture and digital signal processing.
ISBN 0-7923-9364-3

Algorithms for targeting strikes in a lines-of-communication (LOC) network
Wollmer, Richard D
Santa Monica, Calif.. Rand Corp.,. 1969. 20 p. ;.

ALGORITHMS FOR TARGETING STRIKES IN A LINES-OF-COMMUNICATION (LOC) NETWORK. BY RICHARD D. WOLLMER. SANTA MONIKA, CALIF. 1969. 7,20 S.
WOLLMER, RICHARD D.
1969. RAND CORPORATION. MEMORANDUM. RM-5864-PR..

Algorithms for the analysis of 3D magnetic resonance angiography images
Tizon, Xavier,
Uppsala. Centre for Image Analysis, Swedish Univ. of Agricultural Sciences,. 2004. 76 s..

Algorithms for the application of Hartmann-Shack wavefront sensors in ophthalmology
Schottner, Michael
Online-Ressource..

Algorithms for the arithmetic of dense matrices from BEM/FEM: July 8th - July 14th, 2001
Hackbusch, Wolfgang
Zürich . Polygraphischer Verlag. 1953. XVI, 676 S..

Algorithms for the computation of mathematical functions
Luke, Yudell L.
New York. Academic Press,. 1977.. xiii, 284 p. ;.

Algorithms for the constrained design of digital filters with arbitrary magnitude and phase responses
Lang, Mathias
Wien. Österr. Kunst- und Kulturverl.. 2000. 233 S. : graph. Darst.. Dissertationen der Technischen Universität Wien / Technische Universität <Wien> ; 91.
ISBN 3-85437-205-1

Algorithms for the design of automated guided vehicle systems
Wilson, Kathryn Ann,
1992.. viii, 72 leaves.

Algorithms for the diagnosis and management of musculoskeletal complaints
Lipsky, Peter E. ¬[Hrsg.]¬
New York, NY. Excerpta Medica. 1997. 85S S. : graph. Darst.. ¬The¬ American journal of medicine ; 103,6A.

Algorithms for the different steps in the numerical solution of partial differential equations and application to the design of an ion extraction system
Häuser, Jochen ; Tanzer, F.
Geesthacht. GKSS. 1978. 20 S.. Gesellschaft für Kernenergieverwertung in Schiffbau und Schiffahrt ; 78/E/24.

ALGORITHMS FOR THE DIFFERENT STEPS IN THE NUMERICAL SOLUTION OF PARTIAL DIFFERENTIAL EQUATIONS AND APPLICATION TO THE DESIGN OF AN ION EXTRACTION SYSTEM / J. HAEUSER ; F. TANZER
Häuser, Jochem ; TANZER, FRIEDRICH
GEESTHACHT BEI HAMBURG. GESELLSCHAFT FUER KERNENERGIEVERWERTUNG IN SCHIFFBAU UND SCHIFFAHRT M.B.H.. 1978. 20 S. : 9 GRAPH. DARST.. GESELLSCHAFT FUER KERNENERGIEVERWERTUNG IN SCHIFFBAU UND SCHIFFAHRT M.B.H. ; 78,E,24.

Algorithms for the geometry of semi-algebraic sets
Arnon, Dennis Soulé
Madison, WI. Computer Sciences Dep., University of Wisconsin. 1981. 188 Bl.. Technical report ; 436.

Algorithms for the incorporation of predictive information in surveillance theory
Castañon, David A. ; Levy, Bernard C. ; Willsky, Alan S.
[Cambridge, Mass.. Massachusetts Institute of Technology, Laboratory for Information and Decision Systems,. 1985]. p. 367-382 ;.

Algorithms for the numerical implementation of the geometric algebra
Garvin, A. D. M. ; Andrews, M. D. D.
Cambridge. Univ. of Cambridge, Department of Engineering. 1994. 26 S.. CUED/F-INFENG/TR ; 190.

Algorithms for the on-line traveling salesman
Amsterdam. 1996. 27 S. : graph. Darst.. Discussion paper.

Algorithms for the satisfiability problem
Gu, Jun
Cambridge. Cambridge University Press. 1999. 250p.
ISBN 0-521-64041-5 : £30.00

Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
Glenn, Andrew M.,
c2001.. 104 leaves.

Algorithms for the simulation of surface processes
Segers, John Peter Leon
Eindhoven. Technische Universiteit. 1999. IV, 210 S.. NUGI ; 859.
ISBN 90-386-0661-3

Algorithms for the state probabilities and waiting times in single server queueing systems with random and quasirandom input and phase-type service times
Tijms, H. ; Hoorn, M. Van
1980. 17 S.. Reports ; BW 120/80.

Algorithms for the Steiner problem in networks
Polzin, Tobias
2004.

Algorithms for the weighted orthogonal Procrustes problem and other least squares problems
Viklands, Thomas,
Ume¯. Univ.,. 2006 . ix, 175 s..

Algorithms for thinning and rethickening binary digital pattern
Nagendraprasad, M. V. ; Wang, Patrick S-P. ; Gupta, Amar.
Cambridge, MA. [Productivity From Information Technology], "PROFIT" [Research] Initiative, [Sloan School of Management], MIT,. 1993.. p. 97-102.

Algorithms for three-dimensional free-form object matching
Ko, Kwang Hee,
c2003.. 126 leaves.