Proving Divide and Conquer Complexities in Isabelle/HOL

The Akra–Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195–210,  1998 . doi: 10.1023/A:1018373005182 ), a generalisation of the well-known Master Theorem, is a useful tool for analysing the complexity of Divide and Conquer algorithms. This work describes a formalisation of the Akra–Bazzi m...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of automated reasoning Ročník 58; číslo 4; s. 483 - 508
Hlavný autor: Eberl, Manuel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Netherlands 01.04.2017
Predmet:
Algorithms
Artificial Intelligence
Automated reasoning
Automation
Complexity
Computer Science
Derivation
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Symbolic and Algebraic Manipulation
Texts
Theorem proving
Theorems
Divide and Conquer algorithms
Isabelle/HOL
Akra–Bazzi
Master Theorem
Landau symbols
Recurrences
Complexity
ISSN:0168-7433, 1573-0670
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract The Akra–Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195–210,  1998 . doi: 10.1023/A:1018373005182 ), a generalisation of the well-known Master Theorem, is a useful tool for analysing the complexity of Divide and Conquer algorithms. This work describes a formalisation of the Akra–Bazzi method (as generalised by Leighton in Notes on better Master theorems for divide-and-conquer recurrences,  1996 . http://courses.csail.mit.edu/6.046/spring04/handouts/akrabazzi.pdf ) in the interactive theorem prover Isabelle/HOL and the derivation of a generalised version of the Master Theorem from it. We also provide some automated proof methods that facilitate the application of this Master Theorem and allow mostly automatic verification of Θ -bounds for these Divide and Conquer recurrences. To our knowledge, this is the first formalisation of theorems for the analysis of such recurrences.
AbstractList The Akra–Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195–210,  1998 . doi: 10.1023/A:1018373005182 ), a generalisation of the well-known Master Theorem, is a useful tool for analysing the complexity of Divide and Conquer algorithms. This work describes a formalisation of the Akra–Bazzi method (as generalised by Leighton in Notes on better Master theorems for divide-and-conquer recurrences,  1996 . http://courses.csail.mit.edu/6.046/spring04/handouts/akrabazzi.pdf ) in the interactive theorem prover Isabelle/HOL and the derivation of a generalised version of the Master Theorem from it. We also provide some automated proof methods that facilitate the application of this Master Theorem and allow mostly automatic verification of Θ -bounds for these Divide and Conquer recurrences. To our knowledge, this is the first formalisation of theorems for the analysis of such recurrences.
(ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).The Akra-Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195-210, 1998. doi:10.1023/A:1018373005182), a generalisation of the well-known Master Theorem, is a useful tool for analysing the complexity of Divide and Conquer algorithms. This work describes a formalisation of the Akra-Bazzi method (as generalised by Leighton in Notes on better Master theorems for divide-and-conquer recurrences, 1996. http://courses.csail.mit.edu/6.046/spring04/handouts/akrabazzi.pdf ) in the interactive theorem prover Isabelle/HOL and the derivation of a generalised version of the Master Theorem from it. We also provide some automated proof methods that facilitate the application of this Master Theorem and allow mostly automatic verification of ...-bounds for these Divide and Conquer recurrences. To our knowledge, this is the first formalisation of theorems for the analysis of such recurrences.
Author Eberl, Manuel
Author_xml – sequence: 1
  givenname: Manuel
  orcidid: 0000-0002-4263-6571
  surname: Eberl
  fullname: Eberl, Manuel
  email: eberlm@in.tum.de
  organization: Fakultät für Informatik, Technische Universität München
BookMark eNp9kD1vwjAURa2KSgXaH9AtYxeX92IndsaKfoCERId2thzHQUbBoXZA7b-vEZ06MN3h3fN0dSZk5HtvCblHeEQAMYsIEgUFLGnFhKRwRcZYCEahFDAi43SQVHDGbsgkxi0AMIRqTMR76I_Ob7Jnd3SNzbRvsnnvvw42pNztO_vtBmdj5ny2jLq2XWdni_Xqlly3uov27i-n5PP15WO-oKv123L-tKKG5ThQaQU2WLSF4VBzMII1mBve1rkuWM1LqLiWFRR1g7ZBbMvG5MJILnRZy4obNiUP57_70KdRcVA7F01aob3tD1GhrJiUJRciVcW5akIfY7CtMm7Qg-v9ELTrFII6qVJnVSoZUSdVChKJ_8h9cDsdfi4y-ZmJqes3Nqhtfwg-ubgA_QLKTXvj
CitedBy_id crossref_primary_10_1016_j_sysarc_2020_101707
crossref_primary_10_1007_s10817_020_09563_y
Cites_doi 10.1007/978-3-642-12251-4_9
10.1145/2487241.2487242
10.1109/18.259639
10.1007/s00453-002-1003-4
10.1007/s10817-013-9284-7
10.1023/A:1018373005182
10.1007/978-3-540-25984-8_27
ContentType Journal Article
Copyright Springer Science+Business Media Dordrecht 2016
Copyright_xml – notice: Springer Science+Business Media Dordrecht 2016
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1007/s10817-016-9378-0
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1573-0670
EndPage 508
ExternalDocumentID 10_1007_s10817_016_9378_0
GrantInformation_xml – fundername: Deutsche Forschungsgemeinschaft (DE)
  grantid: RTG 1480 (PUMA)
  funderid: http://dx.doi.org/10.13039/501100001659
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29J
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
6TJ
78A
8FE
8FG
8TC
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACNCT
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K6V
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9O
PF0
PT4
PT5
PTHSS
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VXZ
W23
W48
WH7
WK8
YLTOR
Z45
Z7R
Z7X
Z83
Z88
Z8M
Z8R
Z8W
Z92
ZMTXR
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c321t-8e71d15f5c40b40c73d12c4fb2a53b46094a8905bd1ed11f6dc27c847a6b894c3
IEDL.DBID RSV
ISICitedReferencesCount 12
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000395620600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0168-7433
IngestDate Thu Sep 04 16:47:38 EDT 2025
Sat Nov 29 05:55:12 EST 2025
Tue Nov 18 21:13:16 EST 2025
Fri Feb 21 02:34:11 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 4
Keywords Divide and Conquer algorithms
Isabelle/HOL
Akra–Bazzi
Master Theorem
Landau symbols
Recurrences
Complexity
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c321t-8e71d15f5c40b40c73d12c4fb2a53b46094a8905bd1ed11f6dc27c847a6b894c3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ORCID 0000-0002-4263-6571
PQID 1893886477
PQPubID 23500
PageCount 26
ParticipantIDs proquest_miscellaneous_1893886477
crossref_citationtrail_10_1007_s10817_016_9378_0
crossref_primary_10_1007_s10817_016_9378_0
springer_journals_10_1007_s10817_016_9378_0
PublicationCentury 2000
PublicationDate 20170400
2017-4-00
20170401
PublicationDateYYYYMMDD 2017-04-01
PublicationDate_xml – month: 4
  year: 2017
  text: 20170400
PublicationDecade 2010
PublicationPlace Dordrecht
PublicationPlace_xml – name: Dordrecht
PublicationTitle Journal of automated reasoning
PublicationTitleAbbrev J Autom Reasoning
PublicationYear 2017
Publisher Springer Netherlands
Publisher_xml – name: Springer Netherlands
References Avigad, Donnelly, Basin, Rusinowitch (CR2) 2004
Akra, Bazzi (CR1) 1998; 10
CR3
Ballarin (CR4) 2014; 52
CR9
Cormen, Leiserson, Rivest, Stein (CR7) 2009
CR14
CR13
CR12
Bazzi, Mitter (CR5) 2003; 36
CR10
Haftmann, Nipkow, Blume, Kobayashi, Vidal (CR11) 2010
Drmota, Szpankowski (CR8) 2013; 60
Boncelet (CR6) 1993; 39
M Akra (9378_CR1) 1998; 10
L Bazzi (9378_CR5) 2003; 36
9378_CR10
F Haftmann (9378_CR11) 2010
9378_CR13
M Drmota (9378_CR8) 2013; 60
9378_CR12
C Ballarin (9378_CR4) 2014; 52
9378_CR14
CG Boncelet Jr (9378_CR6) 1993; 39
9378_CR9
J Avigad (9378_CR2) 2004
9378_CR3
TH Cormen (9378_CR7) 2009
References_xml – start-page: 103
  year: 2010
  end-page: 117
  ident: CR11
  article-title: Code generation via higher-order rewrite systems
  publication-title: Functional and Logic Programming.
  doi: 10.1007/978-3-642-12251-4_9
– year: 2009
  ident: CR7
  publication-title: Introduction to Algorithms, 4th printing
– volume: 60
  start-page: 16:1
  issue: 3
  year: 2013
  end-page: 16:49
  ident: CR8
  article-title: A Master theorem for discrete divide and conquer recurrences
  publication-title: J. ACM
  doi: 10.1145/2487241.2487242
– volume: 39
  start-page: 1546
  issue: 5
  year: 1993
  end-page: 1554
  ident: CR6
  article-title: Block arithmetic coding for source compression
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/18.259639
– ident: CR3
– ident: CR14
– volume: 36
  start-page: 41
  issue: 1
  year: 2003
  end-page: 57
  ident: CR5
  article-title: The solution of linear probabilistic recurrence relations
  publication-title: Algorithmica
  doi: 10.1007/s00453-002-1003-4
– ident: CR12
– ident: CR13
– ident: CR10
– ident: CR9
– volume: 52
  start-page: 123
  issue: 2
  year: 2014
  end-page: 153
  ident: CR4
  article-title: Locales: a module system for mathematical theories
  publication-title: J. Autom. Reason.
  doi: 10.1007/s10817-013-9284-7
– start-page: 357
  year: 2004
  end-page: 371
  ident: CR2
  article-title: Formalizing notation in Isabelle/HOL
  publication-title: Automated Reasoning,
– volume: 10
  start-page: 195
  issue: 2
  year: 1998
  end-page: 210
  ident: CR1
  article-title: On the solution of linear recurrence equations
  publication-title: Comput. Optim. Appl.
  doi: 10.1023/A:1018373005182
– ident: 9378_CR3
– volume: 36
  start-page: 41
  issue: 1
  year: 2003
  ident: 9378_CR5
  publication-title: Algorithmica
  doi: 10.1007/s00453-002-1003-4
– start-page: 357
  volume-title: Automated Reasoning, Lecture Notes in Computer Science
  year: 2004
  ident: 9378_CR2
  doi: 10.1007/978-3-540-25984-8_27
– start-page: 103
  volume-title: Functional and Logic Programming. Lecture Notes in Computer Science
  year: 2010
  ident: 9378_CR11
  doi: 10.1007/978-3-642-12251-4_9
– volume: 60
  start-page: 16:1
  issue: 3
  year: 2013
  ident: 9378_CR8
  publication-title: J. ACM
  doi: 10.1145/2487241.2487242
– volume: 39
  start-page: 1546
  issue: 5
  year: 1993
  ident: 9378_CR6
  publication-title: IEEE Trans. Inf. Theory
  doi: 10.1109/18.259639
– ident: 9378_CR10
– ident: 9378_CR13
– ident: 9378_CR12
– volume: 52
  start-page: 123
  issue: 2
  year: 2014
  ident: 9378_CR4
  publication-title: J. Autom. Reason.
  doi: 10.1007/s10817-013-9284-7
– ident: 9378_CR14
– volume: 10
  start-page: 195
  issue: 2
  year: 1998
  ident: 9378_CR1
  publication-title: Comput. Optim. Appl.
  doi: 10.1023/A:1018373005182
– ident: 9378_CR9
– volume-title: Introduction to Algorithms, 4th printing
  year: 2009
  ident: 9378_CR7
SSID ssj0003109
Score 2.2061493
Snippet The Akra–Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195–210,  1998 . doi: 10.1023/A:1018373005182 ), a generalisation of the well-known Master...
(ProQuest: ... denotes formulae and/or non-USASCII text omitted; see image).The Akra-Bazzi method (Akra and Bazzi in Comput Optim Appl 10(2):195-210, 1998....
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 483
SubjectTerms Algorithms
Artificial Intelligence
Automated reasoning
Automation
Complexity
Computer Science
Derivation
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Symbolic and Algebraic Manipulation
Texts
Theorem proving
Theorems
Title Proving Divide and Conquer Complexities in Isabelle/HOL
URI https://link.springer.com/article/10.1007/s10817-016-9378-0
https://www.proquest.com/docview/1893886477
Volume 58
WOSCitedRecordID wos000395620600002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-0670
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0003109
  issn: 0168-7433
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA8yffDF-Ynziwg-KcGmSZv0UaZjgsyBH-ytJGkKA-lk3fz7zbXNpqKCvl9CuLvk7nJ3v0PozPnonNlAEmFpQrhOFNGaKhIFhmnuFFqF9bAJMRjI0SgZNn3cpa929ynJ6qX-0OwmKZRJxsSZVElcnL4aAdgMhOgPz4vnF6Aua0BvAMpkzKcyv9viszFaephfkqKVrem1_3XKTbTRuJb4qtaFLbRii23U9mMbcHOLd5AY1t8I-BpasSxWRYa7k8IdaoqBGiAyAWYVjwt8WyrITNjL_v3dLnrq3Tx2-6SZn0AMC-mMSCtoRqM8MjzQPDCCZTQ0PNehipwgYhfZKZkEkc6ozSjN48yEwjhzpWItE27YHmoVk8LuI6xdIBs7GRpuNafCJCzTsU2cO6SZsnnQQYFnZGoacHGYcfGSLmGRgTEpFJQBY1K35Hyx5LVG1viN-NRLJ3X6D0kNVdjJvEypc7ikhHbaDrrwIkmbi1j-vOPBn6gP0XoI9rwq2TlCrdl0bo_RmnmbjcvpSaWA732H0rM
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA-igr44P3F-RvBJCTZN2qaPMh0bzjlwyt5CkqYwkE7Wzb_f3NpuKiro-yWEu0vuLnf3O4TOnY_OmfUEiSyNCdexIlpTRQLPMM2dQiu_GDYRdbtiMIh7ZR93XlW7VynJ2Uv9odlNUCiTDIkzqYK4OH2Fw5QdCNEfn-fPL0BdFoDeAJTJWJXK_G6Lz8Zo4WF-SYrObE2z9q9TbqKN0rXE14UubKElm22jWjW2AZe3eAdFveIbAd9AK5bFKktwY5S5Q40xUANEJsCs4mGG27mCzIS9aj10dtFT87bfaJFyfgIxzKcTImxEExqkgeGe5p6JWEJ9w1Ptq8AJInSRnRKxF-iE2oTSNEyMHxlnrlSoRcwN20PL2Siz-whrF8iGToaGW81pZGKW6NDGzh3STNnUqyOvYqQ0Jbg4zLh4kQtYZGCMhIIyYIx0Sy7mS14LZI3fiM8q6Uin_5DUUJkdTXNJncMlBLTT1tFlJRJZXsT85x0P_kR9itZa_fuO7LS7d4do3QfbPivfOULLk_HUHqNV8zYZ5uOTmTK-A2c81Zc
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwEA-iIr44P3F-RvBJCWuatE0fZXNsOObwi72VJE1hIN1YO_9-c2u7qaggvl9CuI_eXe_udwhd2hidM-MIEhgaEq5CSZSikniOZopbhZZusWwi6PfFcBgOyj2nWdXtXpUki5kGQGlK88YkThofBt8EhZZJn1j3KojN2de4TWSgp-vh8WXxKQbYywLcG0AzGavKmt9d8dkxLaPNLwXSud9p1_794m20VYac-KbQkR20YtJdVKvWOeDSuvdQMCh-L-AWjGgZLNMYN8epfeAUAzVAZwL8Kh6luJtJqFiYRue-t4-e27dPzQ4p9yoQzVyaE2ECGlMv8TR3FHd0wGLqap4oV3pWQL7N-KQIHU_F1MSUJn6s3UBbNyZ9JUKu2QFaTcepOURY2QTXt7LV3ChOAx2yWPkmtGGSYtIkTh05FVMjXYKOw-6L12gJlwyMiaDRDBgT2SNXiyOTAnHjN-KLSlKRtQsodsjUjGdZRG0gJgSM2dbRdSWeqDTQ7Ocbj_5EfY42Bq121Ov2747Rpgsuf97Vc4JW8-nMnKJ1_ZaPsunZXC_fAdxE3ns
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Proving+Divide+and+Conquer+Complexities+in+Isabelle%2FHOL&rft.jtitle=Journal+of+automated+reasoning&rft.au=Eberl%2C+Manuel&rft.date=2017-04-01&rft.issn=0168-7433&rft.eissn=1573-0670&rft.volume=58&rft.issue=4&rft.spage=483&rft.epage=508&rft_id=info:doi/10.1007%2Fs10817-016-9378-0&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s10817_016_9378_0
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0168-7433&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0168-7433&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0168-7433&client=summon