Tight comparison bounds for the string prefix-matching problem:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1992
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
92,50 |
| Beschreibung: | 7 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015837 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)35531358 | ||
| 035 | |a (DE-599)BVBBV009015837 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Breslauer, Dany |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Tight comparison bounds for the string prefix-matching problem |c Dany Breslauer ; Livio Colussi ; Laura Toniolo |
| 264 | 1 | |a Amsterdam |c 1992 | |
| 300 | |a 7 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 92,50 | |
| 700 | 1 | |a Colussi, Livio |e Verfasser |4 aut | |
| 700 | 1 | |a Toniolo, Laura |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 92,50 |w (DE-604)BV008928356 |9 92,50 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961367 | ||
Datensatz im Suchindex
| _version_ | 1804123365193023488 |
|---|---|
| any_adam_object | |
| author | Breslauer, Dany Colussi, Livio Toniolo, Laura |
| author_facet | Breslauer, Dany Colussi, Livio Toniolo, Laura |
| author_role | aut aut aut |
| author_sort | Breslauer, Dany |
| author_variant | d b db l c lc l t lt |
| building | Verbundindex |
| bvnumber | BV009015837 |
| ctrlnum | (OCoLC)35531358 (DE-599)BVBBV009015837 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01040nam a2200289 cb4500</leader><controlfield tag="001">BV009015837</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35531358</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015837</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Breslauer, Dany</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Tight comparison bounds for the string prefix-matching problem</subfield><subfield code="c">Dany Breslauer ; Livio Colussi ; Laura Toniolo</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">92,50</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Colussi, Livio</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Toniolo, Laura</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">92,50</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">92,50</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961367</subfield></datafield></record></collection> |
| id | DE-604.BV009015837 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961367 |
| oclc_num | 35531358 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 7 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Breslauer, Dany Verfasser aut Tight comparison bounds for the string prefix-matching problem Dany Breslauer ; Livio Colussi ; Laura Toniolo Amsterdam 1992 7 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 92,50 Colussi, Livio Verfasser aut Toniolo, Laura Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 92,50 (DE-604)BV008928356 92,50 |
| spellingShingle | Breslauer, Dany Colussi, Livio Toniolo, Laura Tight comparison bounds for the string prefix-matching problem |
| title | Tight comparison bounds for the string prefix-matching problem |
| title_auth | Tight comparison bounds for the string prefix-matching problem |
| title_exact_search | Tight comparison bounds for the string prefix-matching problem |
| title_full | Tight comparison bounds for the string prefix-matching problem Dany Breslauer ; Livio Colussi ; Laura Toniolo |
| title_fullStr | Tight comparison bounds for the string prefix-matching problem Dany Breslauer ; Livio Colussi ; Laura Toniolo |
| title_full_unstemmed | Tight comparison bounds for the string prefix-matching problem Dany Breslauer ; Livio Colussi ; Laura Toniolo |
| title_short | Tight comparison bounds for the string prefix-matching problem |
| title_sort | tight comparison bounds for the string prefix matching problem |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT breslauerdany tightcomparisonboundsforthestringprefixmatchingproblem AT colussilivio tightcomparisonboundsforthestringprefixmatchingproblem AT toniololaura tightcomparisonboundsforthestringprefixmatchingproblem |