Dynamic databases with optimal in order time complexity.
Saved in:
| Title: | Dynamic databases with optimal in order time complexity. |
|---|---|
| Authors: | Lapshov, I. S. |
| Source: | Discrete Mathematics & Applications. 2008, Vol. 18 Issue 4, p367-379. 13p. 1 Diagram. |
| Database: | Mathematics Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: msf DbLabel: Mathematics Source An: 47101995 AccessLevel: 2 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Dynamic databases with optimal in order time complexity. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lapshov%2C+I%2E+S%2E%22">Lapshov, I. S.</searchLink> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Discrete+Mathematics+%26+Applications%22">Discrete Mathematics & Applications</searchLink>. 2008, Vol. 18 Issue 4, p367-379. 13p. 1 Diagram. |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=msf&AN=47101995 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1515/DMA.2008.027 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 13 StartPage: 367 Titles: – TitleFull: Dynamic databases with optimal in order time complexity. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lapshov, I. S. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 10 Text: 2008 Type: published Y: 2008 Identifiers: – Type: issn-print Value: 09249265 Numbering: – Type: volume Value: 18 – Type: issue Value: 4 Titles: – TitleFull: Discrete Mathematics & Applications Type: main |
| ResultId | 1 |