|
|
|
|
| LEADER |
00000cam a22000004a 4500 |
| 001 |
32a146d0-ce33-4cfe-99ef-47645ee67a34 |
| 005 |
20240705000000.0 |
| 008 |
020701s2002 gw a ob 101 0 eng |
| 010 |
|
|
|a 2002026845
|
| 015 |
|
|
|a GBA2-52705
|
| 016 |
7 |
|
|a 964698811
|2 GyFmDB
|
| 019 |
|
|
|a 50401632
|
| 020 |
|
|
|a 3540439773 (softcover : alk. paper)
|
| 035 |
|
|
|a (OCoLC)967849507
|
| 040 |
|
|
|a DLC
|c DLC
|d C$Q
|d OHX
|d UKM
|
| 042 |
|
|
|a pcc
|
| 050 |
0 |
0 |
|a QA76.9.A43
|b A42 2002
|
| 072 |
|
7 |
|a QA
|2 lcco
|
| 082 |
0 |
0 |
|a 005.1
|2 21
|
| 111 |
2 |
|
|a ALENEX 2002
|d (2002 :
|c San Francisco, Calif.)
|
| 245 |
1 |
0 |
|a Algorithm engineering and experiments :
|b 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5. 2002 : revised papers /
|c David Mount, Clifford Stein (eds.).
|
| 260 |
|
|
|a Berlin :
|b Springer,
|c 2002.
|
| 300 |
|
|
|a viii, 205 pages :
|b illustrations ;
|c 24 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a Lecture notes in computer science ;
|v 2409
|
| 530 |
|
|
|a Also available on the World Wide Web.
|
| 650 |
|
0 |
|a Computer algorithms
|v Congresses
|
| 655 |
|
7 |
|a Electronic books.
|2 local
|
| 650 |
|
4 |
|a ordonnancement.
|
| 650 |
|
4 |
|a cluster.
|
| 650 |
|
4 |
|a algorithme réseau.
|
| 650 |
|
4 |
|a algorithme graphe.
|
| 650 |
|
4 |
|a algorithme géométrique.
|
| 650 |
|
6 |
|a Algorithmes
|v Congrès.
|
| 650 |
|
7 |
|a Computer algorithms
|2 fast
|0 (OCoLC)fst00872010
|
| 650 |
|
7 |
|a Algorithmes
|x Congrès.
|9 fre
|2 ram
|
| 650 |
0 |
7 |
|a Algorithmentheorie.
|2 swd
|
| 650 |
0 |
7 |
|a Algorithmus.
|2 swd
|
| 650 |
0 |
7 |
|a Datenstruktur.
|2 swd
|
| 650 |
0 |
7 |
|a Kongress.
|2 swd
|
| 650 |
|
7 |
|a algorithme graphe.
|2 inriac
|
| 650 |
|
7 |
|a algorithme géométrique.
|2 inriac
|
| 650 |
|
7 |
|a algorithme réseau.
|2 inriac
|
| 650 |
|
7 |
|a cluster.
|2 inriac
|
| 650 |
|
7 |
|a ordonnancement.
|2 inriac
|
| 650 |
0 |
7 |
|a Algorithmentheorie
|0 (DE-588)4200409-3
|2 gnd
|
| 650 |
0 |
7 |
|a Algorithmus
|0 (DE-588)4001183-5
|2 gnd
|
| 650 |
0 |
7 |
|a Datenstruktur
|0 (DE-588)4011146-5
|2 gnd
|
| 655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|0 (OCoLC)fst01423772
|
| 655 |
|
7 |
|a San Francisco (Calif., 2002)
|2 swd
|
| 655 |
|
4 |
|a Kongress
|z San Francisco (Calif.)
|y 2002.
|
| 700 |
1 |
|
|a Mount, David M.
|
| 700 |
1 |
|
|a Stein, Clifford,
|d 1965-
|
| 830 |
|
0 |
|a Lecture notes in computer science
|v 2409.
|
| 999 |
1 |
0 |
|i 32a146d0-ce33-4cfe-99ef-47645ee67a34
|l 9946507220001701
|s US-MNU
|m algorithm_engineering_and_experiments4th_international_workshop_alenex_____2002_______sprina________________________________________alenex_2002________________________e
|
| 999 |
1 |
1 |
|l 9946507220001701
|s ISIL:US-MNU
|i University of Minnesota
|t BKS
|a TSCIGEN
|c QA76.9.A43 A42 2002
|d LCC
|b 31951D02243629A
|x BOOK
|y 23451407760001701
|p LOANABLE
|