Bounded incremental computation:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | German |
| Published: |
Berlin u.a.
Springer
1996
|
| Series: | Lecture notes in computer science
1089 |
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XI, 190 S. graph. Darst. |
| ISBN: | 354061320X |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010764375 | ||
| 003 | DE-604 | ||
| 005 | 19960814 | ||
| 007 | t| | ||
| 008 | 960513s1996 gw d||| |||| 00||| ger d | ||
| 016 | 7 | |a 947428461 |2 DE-101 | |
| 020 | |a 354061320X |c kart. : DM 46.00 |9 3-540-61320-X | ||
| 035 | |a (OCoLC)34752896 | ||
| 035 | |a (DE-599)BVBBV010764375 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91G |a DE-384 |a DE-739 |a DE-20 |a DE-19 |a DE-706 |a DE-634 |a DE-83 | ||
| 050 | 0 | |a QA76.R263 1996 | |
| 082 | 0 | |a 004/.01/5114 |2 20 | |
| 082 | 0 | |a 004/.01/5114 20 | |
| 084 | |a 27 |2 sdnb | ||
| 084 | |a DAT 532f |2 stub | ||
| 084 | |a 28 |2 sdnb | ||
| 100 | 1 | |a Ramalingam, G. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Bounded incremental computation |c G. Ramalingam |
| 264 | 1 | |a Berlin u.a. |b Springer |c 1996 | |
| 300 | |a XI, 190 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 1089 | |
| 650 | 4 | |a Algorithmes | |
| 650 | 7 | |a Algorithmes |2 ram | |
| 650 | 7 | |a Algoritmen |2 gtt | |
| 650 | 7 | |a Complexité de calcul (informatique) |2 ram | |
| 650 | 4 | |a Graphes, Théorie des - Informatique | |
| 650 | 4 | |a Informatique | |
| 650 | 7 | |a Periodiciteit |2 gtt | |
| 650 | 7 | |a algorithme incrémental |2 inriac | |
| 650 | 7 | |a flot graphe |2 inriac | |
| 650 | 7 | |a graphe |2 inriac | |
| 650 | 7 | |a plus court chemin |2 inriac | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Electronic data processing | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Graph theory | |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Teilauswertung |0 (DE-588)4323152-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 0 | 1 | |a Teilauswertung |0 (DE-588)4323152-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in computer science |v 1089 |w (DE-604)BV000000607 |9 1089 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007188313&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007188313 | |
Record in the Search Index
| _version_ | 1820874850785296384 |
|---|---|
| adam_text |
TABLE
OF
CONTENTS
CHAPTER
1.
INTRODUCTION
.
1
CHAPTER
2.
ON
INCREMENTAL
ALGORITHMS
AND
THEIR
COMPLEXITY
.
7
2.1.
INCREMENTAL
ALGORITHMS:
WHY
AND
WHERE?
.
7
2.2.
WHY
INCREMENTAL
GRAPH
ALGORITHMS?
.
9
2.2.1.
THE
REACHABILITY
PROBLEM
.
9
2.2.2.
THE
SHORTEST-PATH
PROBLEM
.
10
2.2.3.
THE
CIRCUIT
VALUE
ANNOTATION
PROBLEM
.
10
2.2.4.
THE
DOMINATOR
TREE
PROBLEM
.
11
2.3.
EVALUATING
INCREMENTAL
ALGORITHMS:
WHY
AND
HOW?
.
11
2.3.1.
ANALYTICAL
EVALUATION
OF
INCREMENTAL
ALGORITHMS
.
12
2.3.1.1.
ASYMPTOTIC
ANALYSIS
VERSUS
MICRO-ANALYSIS
.
13
2.3.1.2.
ALTERNATIVES
TO
WORST-CASE
ANALYSIS
.
13
2.3.1.3.
ALTERNATIVES
TO
INPUT
SIZE
AS
COMPLEXITY
PARAMETERS
.
16
2.3.1.4.
ON
CLASSIFYING
INCREMENTAL
COMPUTATION
PROBLEMS
.
20
2.3.2.
EXPERIMENTAL
EVALUATION
OF
INCREMENTAL
ALGORITHMS
.
22
CHAPTER
3.
TERMINOLOGY
AND
NOTATION
.
25
CHAPTER
4.
INCREMENTAL
ALGORITHMS
FOR
SHORTEST-PATH
PROBLEMS
.
30
4.1.
THE
DYNAMIC
SINGLE-SINK
SHORTEST-PATH
PROBLEM
.
30
4.1.1.
DELETION
OF
AN
EDGE
.
31
4.1.2.
INSERTION
OF
AN
EDGE
.
36
4.1.3.
HANDLING
EDGES
OF
NON-POSITIVE
LENGTH
.
38
4.1.4.
A
BATCH
SSSP
ALGORITHM
.
42
4.2.
THE
DYNAMIC
ALL-PAIRS
SHORTEST-PATH
PROBLEM
.
43
4.2.1.
DELETION
OF
AN
EDGE
.
45
4.2.2.
INSERTION
OF
AN
EDGE
.
48
4.2.3.
HANDLING
EDGES
OF
NON-POSITIVE
LENGTH
.
51
4.3.
RELATED
WORK
.
51
CHAPTER
5.
GENERALIZATIONS
OF
THE
SHORTEST-PATH
PROBLEM
.
52
5.1.
AN
OVERVIEW
OF
THE
CHAPTER
.
52
5.2.
MAXIMUM
FIXED
POINT
PROBLEMS
.
55
X
5.3.
PATH
PROBLEMS
IN
GRAPHS
.
56
5.3.1.
ALGEBRAIC
PATH
PROBLEMS
.
56
5.3.2.
DATAFLOW
ANALYSIS
PROBLEMS
.
61
5.3.3.
THE
RELATION
BETWEEN
DATAFLOW
ANALYSIS
AND
ALGEBRAIC
PATH
PROBLEMS
.
62
5.4.
GRAMMAR
PROBLEMS
.
63
5.4.1.
THE
IDEA
BEHIND
THE
PROBLEM
.
63
5.4.2.
THE
PROBLEM
DEFINITION
.
66
5.4.3.
THE
GRAMMAR
PROBLEM
AS
A
MAXIMUM
FIXED
POINT
PROBLEM
.
69
5.4.4.
THE
SSF
GRAMMAR
PROBLEM
AND
THE
SWSF
FIXED
POINT
PROBLEM
.
71
5.5.
RELATED
WORK
.
77
CHAPTER
6.
AN
INCREMENTAL
ALGORITHM
FOR
A
GENERALIZATION
OF
THE
SHORTEST-PATH
PROBLEM
.
78
6.1.
INTRODUCTION
.
78
6.2.
THE
IDEA
BEHIND
THE
ALGORITHM
.
79
6.3.
THE
ALGORITHM
.
85
6.4.
AN
IMPROVED
ALGORITHM
.
87
6.5.
EXTENSIONS
TO
THE
ALGORITHM
.
92
6.5.1.
ANSWERING
QUERIES
ON
DEMAND
.
92
6.5.2.
MAINTAINING
MINIMUM
COST
DERIVATIONS
.
93
6.5.3.
THE
ALL-PAIRS
SHORTEST-PATH
PROBLEM
.
94
6.5.4.
HANDLING
EDGES
OF
NON-POSITIVE
LENGTH
.
94
6.6.
RELATED
WORK
.
95
CHAPTER
7.
INCREMENTAL
ALGORITHMS
FOR
THE
CIRCUIT
VALUE
ANNOTATION
PROBLEM
.
101
7.1.
INTRODUCTION
.
101
7.2.
THE
CHANGE
PROPAGATION
STRATEGY
.
103
7.3.
THE
ITERATIVE
EVALUATE-AND-EXPAND
STRATEGY
.
107
7.4.
BREADTH-FIRST
EXPANSION
.
110
7.4.1.
BOUNDED-OUTDEGREE
CIRCUITS
.
110
7.4.2.
HANDLING
UNBOUNDED
OUTDEGREE
.
112
7.4.3.
MONOTONIC
CIRCUITS:
A
SPECIAL
CASE
.
114
XI
7.4.4.
A
TRADEOFF
.
115
7.5.
THE
WEIGHTED
CIRCUIT
VALUE
ANNOTATION
PROBLEM
.
119
7.6.
THE
EMPIRICAL
BOUNDEDNESS
OF
INCREMENTAL
ALGORITHMS
.
124
7.7.
SOME
REMARKS
.
128
CHAPTER
8.
INHERENTLY
UNBOUNDED
INCREMENTAL
COMPUTATION
PROBLEMS
.
130
8.1.
INTRODUCTION
.
130
8.2.
THE
MODEL
OF
COMPUTATION
.
130
8.2.1.
LOCALLY
PERSISTENT
ALGORITHMS
.
130
8.2.2.
THE
COST
OF
ELEMENTARY
OPERATIONS
.
131
8.2.3.
SPARSELY
ALIASING
ALGORITHMS
.
133
8.3.
THE
UNBOUNDEDNESS
OF
REACHABILITY
.
137
8.4.
OTHER
UNBOUNDED
PROBLEMS
.
142
8.4.1.
UNBOUNDED
PATH
PROBLEMS
.
142
8.4.2.
UNBOUNDED
DATAFLOW
ANALYSIS
PROBLEMS
.
144
8.5.
SOME
REMARKS
.
146
CHAPTER
9.
INCREMENTAL
ALGORITHMS
FOR
REDUCIBLE
FLOWGRAPHS
.
147
9.1.
INTRODUCTION
.
147
9.2.
REACHABILITY,
DOMINATION,
AND
REDUCIBLE
FLOWGRAPHS
.
147
9.3.
THE
DYNAMIC
SINGLE-SOURCE
REACHABILITY
PROBLEM
.
149
9.3.1.
INSERTION
OF
AN
EDGE
.
153
9.3.2.
DELETION
OF
AN
EDGE
.
153
9.3.3.
HANDLING
IRREDUCIBLE
FLOWGRAPHS
.
153
9.4.
THE
DYNAMIC
DOMINATOR
TREE
PROBLEM
.
156
9.4.1.
INSERTION
OF
AN
EDGE
.
158
9.4.2.
DELETION
OF
AN
EDGE
.
164
9.4.3.
RELATED
WORK
.
166
9.4.4.
SOME
REMARKS
.
167
CHAPTER
10.
CONCLUSIONS
.
169
BIBLIOGRAPHY.
172 |
| any_adam_object | 1 |
| author | Ramalingam, G. |
| author_facet | Ramalingam, G. |
| author_role | aut |
| author_sort | Ramalingam, G. |
| author_variant | g r gr |
| building | Verbundindex |
| bvnumber | BV010764375 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.R263 1996 |
| callnumber-search | QA76.R263 1996 |
| callnumber-sort | QA 276 R263 41996 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SS 4800 |
| classification_tum | DAT 532f |
| ctrlnum | (OCoLC)34752896 (DE-599)BVBBV010764375 |
| dewey-full | 004/.01/5114 004/.01/511420 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004/.01/5114 004/.01/5114 20 |
| dewey-search | 004/.01/5114 004/.01/5114 20 |
| dewey-sort | 14 11 45114 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV010764375</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19960814</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">960513s1996 gw d||| |||| 00||| ger d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">947428461</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">354061320X</subfield><subfield code="c">kart. : DM 46.00</subfield><subfield code="9">3-540-61320-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)34752896</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010764375</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">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.R263 1996</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.01/5114</subfield><subfield code="2">20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004/.01/5114 20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">27</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 532f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">28</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ramalingam, G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Bounded incremental computation</subfield><subfield code="c">G. Ramalingam</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 190 S.</subfield><subfield code="b">graph. Darst.</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">Lecture notes in computer science</subfield><subfield code="v">1089</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithmes</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algoritmen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graphes, Théorie des - Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatique</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Periodiciteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme incrémental</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">flot graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">graphe</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">plus court chemin</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Graph theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Teilauswertung</subfield><subfield code="0">(DE-588)4323152-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Teilauswertung</subfield><subfield code="0">(DE-588)4323152-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">1089</subfield><subfield code="w">(DE-604)BV000000607</subfield><subfield code="9">1089</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007188313&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007188313</subfield></datafield></record></collection> |
| id | DE-604.BV010764375 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T15:06:17Z |
| institution | BVB |
| isbn | 354061320X |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007188313 |
| oclc_num | 34752896 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-384 DE-739 DE-20 DE-19 DE-BY-UBM DE-706 DE-634 DE-83 |
| physical | XI, 190 S. graph. Darst. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Ramalingam, G. Verfasser aut Bounded incremental computation G. Ramalingam Berlin u.a. Springer 1996 XI, 190 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Lecture notes in computer science 1089 Algorithmes Algorithmes ram Algoritmen gtt Complexité de calcul (informatique) ram Graphes, Théorie des - Informatique Informatique Periodiciteit gtt algorithme incrémental inriac flot graphe inriac graphe inriac plus court chemin inriac Datenverarbeitung Electronic data processing Computer algorithms Graph theory Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Teilauswertung (DE-588)4323152-4 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 s Teilauswertung (DE-588)4323152-4 s DE-604 Lecture notes in computer science 1089 (DE-604)BV000000607 1089 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007188313&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Ramalingam, G. Bounded incremental computation Lecture notes in computer science Algorithmes Algorithmes ram Algoritmen gtt Complexité de calcul (informatique) ram Graphes, Théorie des - Informatique Informatique Periodiciteit gtt algorithme incrémental inriac flot graphe inriac graphe inriac plus court chemin inriac Datenverarbeitung Electronic data processing Computer algorithms Graph theory Kürzester-Weg-Problem (DE-588)4138403-9 gnd Teilauswertung (DE-588)4323152-4 gnd |
| subject_GND | (DE-588)4138403-9 (DE-588)4323152-4 |
| title | Bounded incremental computation |
| title_auth | Bounded incremental computation |
| title_exact_search | Bounded incremental computation |
| title_full | Bounded incremental computation G. Ramalingam |
| title_fullStr | Bounded incremental computation G. Ramalingam |
| title_full_unstemmed | Bounded incremental computation G. Ramalingam |
| title_short | Bounded incremental computation |
| title_sort | bounded incremental computation |
| topic | Algorithmes Algorithmes ram Algoritmen gtt Complexité de calcul (informatique) ram Graphes, Théorie des - Informatique Informatique Periodiciteit gtt algorithme incrémental inriac flot graphe inriac graphe inriac plus court chemin inriac Datenverarbeitung Electronic data processing Computer algorithms Graph theory Kürzester-Weg-Problem (DE-588)4138403-9 gnd Teilauswertung (DE-588)4323152-4 gnd |
| topic_facet | Algorithmes Algoritmen Complexité de calcul (informatique) Graphes, Théorie des - Informatique Informatique Periodiciteit algorithme incrémental flot graphe graphe plus court chemin Datenverarbeitung Electronic data processing Computer algorithms Graph theory Kürzester-Weg-Problem Teilauswertung |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007188313&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV000000607 |
| work_keys_str_mv | AT ramalingamg boundedincrementalcomputation |