<?xml version="1.0" encoding="UTF-8" standalone="yes"?><add><doc><field name="objectKind">mycoreobject</field><field name="id">rosdok_document_0000028033</field><field name="returnId">rosdok_document_0000028033</field><field name="objectProject">rosdok</field><field name="objectType">document</field><field name="link">rosdok_derivate_0000229933</field><field name="modified">2026-10-20T15:20:07.904Z</field><field name="created">2026-10-20T15:04:49.785Z</field><field name="modifiedby">MCRJANITOR</field><field name="createdby">editorKE</field><field name="state">published</field><field name="derCount">1</field><field name="derivates">rosdok_derivate_0000229933</field><field name="worldReadable">true</field><field name="worldReadableComplete">true</field><field name="category">derivate_types:fulltext</field><field name="allMeta">Volltext</field><field name="allMeta">fulltext</field><field name="allMeta">wf_edit_epub wf_register_epub</field><field name="category">state:published</field><field name="category.top">state:published</field><field name="allMeta">veröffentlicht</field><field name="allMeta">published</field><field name="allMeta">rosdok_id00005895</field><field name="allMeta">1987204301</field><field name="allMeta">Oau</field><field name="allMeta">2026-10-20</field><field name="allMeta">2026-10-20T15:19:52Z</field><field name="allMeta">rda</field><field name="allMeta">Converted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.</field><field name="allMeta">Workingpaper</field><field name="allMeta">Optimization of dual-threshold circuits</field><field name="allMeta">In this paper, we consider an optimization problem on directed acyclic graphs which is motivated by a standard task in low power VLSI design. With each vertex v of a directed acyclic graph, we associate two delay values d0(v) ≤ d1(v) and two leakage values c0(v) ≥ c1(v). The objective is to choose one of the indices 0 or 1 for each vertex, such that in first instance the corresponding total delay along any directed path is minimal, and in second instance the total leakage is minimized. We prove that a very restricted special case of this problem already is NP-hard, and we present four different heuristic approaches to the problem. Further, we test our algorithms on ISCAS85 benchmark circuits.</field><field name="allMeta">Konrad</field><field name="allMeta">Engel</field><field name="allMeta">1956 -</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">138612366</field><field name="allMeta">Thomas</field><field name="allMeta">Kalinowski</field><field name="allMeta">1980 -</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">128420251</field><field name="allMeta">0000-0002-8444-6848</field><field name="allMeta">Roger</field><field name="allMeta">Labahn</field><field name="allMeta">1959 -</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">170999645</field><field name="allMeta">0000-0003-1901-9644</field><field name="allMeta">Frank</field><field name="allMeta">Sill</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">Dirk</field><field name="allMeta">Timmermann</field><field name="allMeta">1957 -</field><field name="allMeta">VerfasserIn</field><field name="allMeta">aut</field><field name="allMeta">132790505</field><field name="allMeta">0000-0001-9267-9695</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005895</field><field name="allMeta">urn:nbn:de:gbv:28-rosdok_id00005895-3</field><field name="allMeta">10.18453/rosdok_id00005895</field><field name="allMeta">510 Mathematik</field><field name="allMeta">Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">alle Rechte vorbehalten</field><field name="allMeta">Rechteinhaber Universität Rostock</field><field name="allMeta">frei zugänglich (Open Access)</field><field name="allMeta">Lizenz Metadaten: CC0</field><field name="allMeta">en</field><field name="allMeta">1 Online-Ressource (19 Seiten)</field><field name="allMeta">2005</field><field name="allMeta">University of Rostock, Institute of Mathematics</field><field name="allMeta">Rostock</field><field name="allMeta">monographic</field><field name="allMeta">2005</field><field name="allMeta">2026</field><field name="allMeta">Universitätsbibliothek Rostock</field><field name="allMeta">Rostock</field><field name="allMeta">2026</field><field name="allMeta">Universitätsbibliothek Rostock</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005895</field><field name="allMeta">Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">05/5</field><field name="allMeta">0005-0005</field><field name="category">doctype:epub</field><field name="category.top">doctype:epub</field><field name="allMeta">Dokumenttyp</field><field name="allMeta">Document type</field><field name="category">doctype:epub.workingpaper</field><field name="category.top">doctype:epub.workingpaper</field><field name="allMeta">Workingpaper</field><field name="allMeta">working paper</field><field name="allMeta">diniPublType:workingPaper diniPublType2022:WorkingPaper</field><field name="allMeta">info:eu-repo/semantics/workingPaper</field><field name="allMeta">document</field><field name="category">diniPublType2022:WorkingPaper</field><field name="category.top">diniPublType2022:WorkingPaper</field><field name="allMeta">Arbeitspapier</field><field name="allMeta">Working paper</field><field name="allMeta">KDSF (Pu37)</field><field name="category">SDNB:510</field><field name="category.top">SDNB:510</field><field name="allMeta">510 Mathematik</field><field name="allMeta">510 Mathematics</field><field name="category">institution:unirostock</field><field name="category.top">institution:unirostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">University of Rostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">Universität Rostock</field><field name="allMeta">Uni.Rostock</field><field name="allMeta">http://d-nb.info/gnd/38329-6</field><field name="category">institution:unirostock.mnf</field><field name="category.top">institution:unirostock.mnf</field><field name="allMeta">Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">Faculty of Mathematics and Natural Sciences</field><field name="allMeta">Universität Rostock. Mathematisch-Naturwissenschaftliche Fakultät</field><field name="allMeta">Mathematisch-Natur-&lt;br /&gt;wissenschaftliche Fakultät</field><field name="allMeta">Uni.Rostock.Fakultaet.MNF</field><field name="allMeta">http://d-nb.info/gnd/2147083-2</field><field name="category">licenseinfo:work</field><field name="category.top">licenseinfo:work</field><field name="allMeta">Werk</field><field name="allMeta">work</field><field name="category">licenseinfo:work.rightsreserved</field><field name="category.top">licenseinfo:work.rightsreserved</field><field name="allMeta">alle Rechte vorbehalten</field><field name="allMeta">all rights reserved</field><field name="allMeta">/creativecommons/r/reserved/0.9/88x31.png</field><field name="allMeta">[DE-28]Urheberrechtsschutz 1.0$gRights Statements$uhttp://rightsstatements.org/vocab/InC/1.0/</field><field name="allMeta">http://rightsstatements.org/vocab/InC/1.0/</field><field name="allMeta">http://rightsstatements.org/vocab/InC/1.0/</field><field name="category">licenseinfo:deposit</field><field name="category.top">licenseinfo:deposit</field><field name="allMeta">Veröffentlichungsgenehmigung</field><field name="allMeta">permission to store</field><field name="category">licenseinfo:deposit.rightsunirostock</field><field name="category.top">licenseinfo:deposit.rightsunirostock</field><field name="allMeta">Rechteinhaber Universität Rostock</field><field name="allMeta">rightsholder Rostock University</field><field name="category">accesscondition:openaccess</field><field name="category.top">accesscondition:openaccess</field><field name="allMeta">frei zugänglich (Open Access)</field><field name="allMeta">open access</field><field name="allMeta">http://purl.org/coar/access_right/c_abf2</field><field name="allMeta">OA</field><field name="allMeta">free</field><field name="allMeta">info:eu-repo/semantics/openAccess</field><field name="allMeta">[DE-28]Open Access$gControlled Vocabulary for Access Rights$uhttp://purl.org/coar/access_right/c_abf2</field><field name="category">licenseinfo:metadata</field><field name="category.top">licenseinfo:metadata</field><field name="allMeta">Lizenzen für Metadaten</field><field name="category">licenseinfo:metadata.cc0</field><field name="category.top">licenseinfo:metadata.cc0</field><field name="allMeta">Lizenz Metadaten: CC0</field><field name="allMeta">license metadata: CC0</field><field name="allMeta">/creativecommons/p/zero/1.0/88x31.png</field><field name="allMeta">https://creativecommons.org/publicdomain/zero/1.0/</field><field name="category">rfc5646:en</field><field name="category.top">rfc5646:en</field><field name="allMeta">Englisch</field><field name="allMeta">English</field><field name="allMeta">eng</field><field name="allMeta">eng</field><field name="mods.title">Optimization of dual-threshold circuits</field><field name="mods.title.main">Optimization of dual-threshold circuits</field><field name="mods.title.subtitle"></field><field name="mods.nameIdentifier">gnd:138612366</field><field name="mods.nameIdentifier">gnd:128420251</field><field name="mods.nameIdentifier">orcid:0000-0002-8444-6848</field><field name="mods.nameIdentifier">gnd:170999645</field><field name="mods.nameIdentifier">orcid:0000-0003-1901-9644</field><field name="mods.nameIdentifier">gnd:132790505</field><field name="mods.nameIdentifier">orcid:0000-0001-9267-9695</field><field name="mods.nameIdentifier.top">gnd:138612366</field><field name="mods.nameIdentifier.top">gnd:128420251</field><field name="mods.nameIdentifier.top">orcid:0000-0002-8444-6848</field><field name="mods.nameIdentifier.top">gnd:170999645</field><field name="mods.nameIdentifier.top">orcid:0000-0003-1901-9644</field><field name="mods.nameIdentifier.top">gnd:132790505</field><field name="mods.nameIdentifier.top">orcid:0000-0001-9267-9695</field><doc><field name="id">rosdok_document_0000028033-d3976943e49</field><field name="mods.nameIdentifier">gnd:138612366</field><field name="mods.name">Konrad Engel</field><field name="mods.name.top">Konrad Engel</field></doc><doc><field name="id">rosdok_document_0000028033-d3976943e63</field><field name="mods.nameIdentifier">gnd:128420251</field><field name="mods.nameIdentifier">orcid:0000-0002-8444-6848</field><field name="mods.name">Thomas Kalinowski</field><field name="mods.name.top">Thomas Kalinowski</field></doc><doc><field name="id">rosdok_document_0000028033-d3976943e79</field><field name="mods.nameIdentifier">gnd:170999645</field><field name="mods.nameIdentifier">orcid:0000-0003-1901-9644</field><field name="mods.name">Roger Labahn</field><field name="mods.name.top">Roger Labahn</field></doc><doc><field name="id">rosdok_document_0000028033-d3976943e95</field><field name="mods.name">Frank Sill</field><field name="mods.name.top">Frank Sill</field></doc><doc><field name="id">rosdok_document_0000028033-d3976943e105</field><field name="mods.nameIdentifier">gnd:132790505</field><field name="mods.nameIdentifier">orcid:0000-0001-9267-9695</field><field name="mods.name">Dirk Timmermann</field><field name="mods.name.top">Dirk Timmermann</field></doc><field name="mods.name">Konrad Engel</field><field name="mods.name">Thomas Kalinowski</field><field name="mods.name">Roger Labahn</field><field name="mods.name">Frank Sill</field><field name="mods.name">Dirk Timmermann</field><field name="mods.name.top">Konrad Engel</field><field name="mods.name.top">Thomas Kalinowski</field><field name="mods.name.top">Roger Labahn</field><field name="mods.name.top">Frank Sill</field><field name="mods.name.top">Dirk Timmermann</field><field name="mods.author">Konrad Engel</field><field name="mods.author">Thomas Kalinowski</field><field name="mods.author">Roger Labahn</field><field name="mods.author">Frank Sill</field><field name="mods.author">Dirk Timmermann</field><field name="mods.place">Rostock</field><field name="mods.publisher">University of Rostock,  Institute of Mathematics</field><field name="mods.genre">epub.workingpaper</field><field name="mods.identifier">https://purl.uni-rostock.de/rosdok/id00005895</field><field name="mods.identifier">urn:nbn:de:gbv:28-rosdok_id00005895-3</field><field name="mods.identifier">10.18453/rosdok_id00005895</field><field name="mods.abstract">In this paper, we consider an optimization problem on directed acyclic graphs which is motivated by a standard task in low power VLSI design. With each vertex v of a directed acyclic graph, we associate two delay values d0(v) ≤ d1(v) and two leakage values c0(v) ≥ c1(v). The objective is to choose one of the indices 0 or 1 for each vertex, such that in first instance the corresponding total delay along any directed path is minimal, and in second instance the total leakage is minimized. We prove that a very restricted special case of this problem already is NP-hard, and we present four different heuristic approaches to the problem. Further, we test our algorithms on ISCAS85 benchmark circuits.</field><field name="mods.dateIssued">2005</field><field name="mods.yearIssued">2005</field><field name="mods.title.series">Preprints aus dem Institut für Mathematik</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">05/5</field><field name="allMeta">0005-0005</field><field name="mods.identifier.series">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="mods.identifier.series">3255797-8</field><field name="mods.relatedItem"></field><field name="mods.relatedItem.series"></field><field name="mods.note.statement of responsibility">Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann</field><field name="mods.type">epub.workingpaper</field><field name="search_result_link_text">1
        Engel_optimization_2005.pdf
        
        184617
        6c9960b004d683aa27d4038194cd3e25
      
    
  
  
    
      
        rosdok_id000058951987204301Oau2026-10-202026-10-20T15:19:52ZrdaConverted from PICA to MODS using Pica2MODS XSLT Transformer 2.14-SNAPSHOT [SCM: "" "" ""] with mode 'DEFAULT'.WorkingpaperOptimization of dual-threshold circuitsIn this paper, we consider an optimization problem on directed acyclic graphs which is motivated by a standard task in low power VLSI design. With each vertex v of a directed acyclic graph, we associate two delay values d0(v) ≤ d1(v) and two leakage values c0(v) ≥ c1(v). The objective is to choose one of the indices 0 or 1 for each vertex, such that in first instance the corresponding total delay along any directed path is minimal, and in second instance the total leakage is minimized. We prove that a very restricted special case of this problem already is NP-hard, and we present four different heuristic approaches to the problem. Further, we test our algorithms on ISCAS85 benchmark circuits.KonradEngel1956 -VerfasserInaut138612366ThomasKalinowski1980 -VerfasserInaut1284202510000-0002-8444-6848RogerLabahn1959 -VerfasserInaut1709996450000-0003-1901-9644FrankSillVerfasserInautDirkTimmermann1957 -VerfasserInaut1327905050000-0001-9267-9695https://purl.uni-rostock.de/rosdok/id00005895urn:nbn:de:gbv:28-rosdok_id00005895-310.18453/rosdok_id00005895510 MathematikMathematisch-Naturwissenschaftliche Fakultätalle Rechte vorbehaltenRechteinhaber Universität Rostockfrei zugänglich (Open Access)Lizenz Metadaten: CC0en1 Online-Ressource (19 Seiten)2005University of Rostock,  Institute of MathematicsRostockmonographic20052026Universitätsbibliothek RostockRostock2026Universitätsbibliothek Rostockhttps://purl.uni-rostock.de/rosdok/id00005895Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermannrosdok_id000058161986139832Odvhttps://purl.uni-rostock.de/rosdok/id00005816Preprints aus dem Institut für Mathematik3255797-805/50005-0005
      
    
  
  
    
      2026-10-20T15:04:49.785Z
      2026-10-20T15:20:07.904Z
      2026-10-30T15:20:07.916Z
    
    
      editorKE
      {"identifier":"rosdok/id00005895","type":"local_id","additional":"","service":"MCRLocalID","created":"2026-10-20T15:04:49.792Z"}
      {"identifier":"urn:nbn:de:gbv:28-rosdok_id00005895-3","type":"dnbUrn","additional":"","service":"RosDokURN","created":"2026-10-20T15:04:49.799Z"}
      {"identifier":"https://purl.uni-rostock.de/rosdok/id00005895","type":"purl","additional":"","service":"RosDokPURL","created":"2026-10-20T15:04:49.803Z","registrationStarted":"2026-10-20T15:20:06.712Z"}
      {"identifier":"10.18453/rosdok_id00005895","type":"doi","additional":"","service":"RosDokDOI","created":"2026-10-20T15:04:49.807Z","registrationStarted":"2026-10-20T15:20:06.464Z","registered":"2026-10-20T15:20:07.902Z"}
      MCRJANITOR</field><field name="derivateLabel">fulltext</field><field name="ir.pdffulltext_url">file/rosdok_document_0000028033/rosdok_derivate_0000229933/Engel_optimization_2005.pdf</field><field name="mods.title">Optimization of dual-threshold circuits</field><field name="mods.title.main">Optimization of dual-threshold circuits</field><field name="mods.title.subtitle"></field><field name="mods.nameIdentifier">gnd:138612366</field><field name="mods.nameIdentifier">gnd:128420251</field><field name="mods.nameIdentifier">orcid:0000-0002-8444-6848</field><field name="mods.nameIdentifier">gnd:170999645</field><field name="mods.nameIdentifier">orcid:0000-0003-1901-9644</field><field name="mods.nameIdentifier">gnd:132790505</field><field name="mods.nameIdentifier">orcid:0000-0001-9267-9695</field><field name="mods.nameIdentifier.top">gnd:138612366</field><field name="mods.nameIdentifier.top">gnd:128420251</field><field name="mods.nameIdentifier.top">orcid:0000-0002-8444-6848</field><field name="mods.nameIdentifier.top">gnd:170999645</field><field name="mods.nameIdentifier.top">orcid:0000-0003-1901-9644</field><field name="mods.nameIdentifier.top">gnd:132790505</field><field name="mods.nameIdentifier.top">orcid:0000-0001-9267-9695</field><doc><field name="id">rosdok_document_0000028033-d3976943e49</field><field name="mods.nameIdentifier">gnd:138612366</field><field name="mods.name">Konrad Engel</field><field name="mods.name.top">Konrad Engel</field></doc><doc><field name="id">rosdok_document_0000028033-d3976943e63</field><field name="mods.nameIdentifier">gnd:128420251</field><field name="mods.nameIdentifier">orcid:0000-0002-8444-6848</field><field name="mods.name">Thomas Kalinowski</field><field name="mods.name.top">Thomas Kalinowski</field></doc><doc><field name="id">rosdok_document_0000028033-d3976943e79</field><field name="mods.nameIdentifier">gnd:170999645</field><field name="mods.nameIdentifier">orcid:0000-0003-1901-9644</field><field name="mods.name">Roger Labahn</field><field name="mods.name.top">Roger Labahn</field></doc><doc><field name="id">rosdok_document_0000028033-d3976943e95</field><field name="mods.name">Frank Sill</field><field name="mods.name.top">Frank Sill</field></doc><doc><field name="id">rosdok_document_0000028033-d3976943e105</field><field name="mods.nameIdentifier">gnd:132790505</field><field name="mods.nameIdentifier">orcid:0000-0001-9267-9695</field><field name="mods.name">Dirk Timmermann</field><field name="mods.name.top">Dirk Timmermann</field></doc><field name="mods.name">Konrad Engel</field><field name="mods.name">Thomas Kalinowski</field><field name="mods.name">Roger Labahn</field><field name="mods.name">Frank Sill</field><field name="mods.name">Dirk Timmermann</field><field name="mods.name.top">Konrad Engel</field><field name="mods.name.top">Thomas Kalinowski</field><field name="mods.name.top">Roger Labahn</field><field name="mods.name.top">Frank Sill</field><field name="mods.name.top">Dirk Timmermann</field><field name="mods.author">Konrad Engel</field><field name="mods.author">Thomas Kalinowski</field><field name="mods.author">Roger Labahn</field><field name="mods.author">Frank Sill</field><field name="mods.author">Dirk Timmermann</field><field name="mods.place">Rostock</field><field name="mods.publisher">University of Rostock,  Institute of Mathematics</field><field name="mods.genre">epub.workingpaper</field><field name="mods.identifier">https://purl.uni-rostock.de/rosdok/id00005895</field><field name="mods.identifier">urn:nbn:de:gbv:28-rosdok_id00005895-3</field><field name="mods.identifier">10.18453/rosdok_id00005895</field><field name="mods.abstract">In this paper, we consider an optimization problem on directed acyclic graphs which is motivated by a standard task in low power VLSI design. With each vertex v of a directed acyclic graph, we associate two delay values d0(v) ≤ d1(v) and two leakage values c0(v) ≥ c1(v). The objective is to choose one of the indices 0 or 1 for each vertex, such that in first instance the corresponding total delay along any directed path is minimal, and in second instance the total leakage is minimized. We prove that a very restricted special case of this problem already is NP-hard, and we present four different heuristic approaches to the problem. Further, we test our algorithms on ISCAS85 benchmark circuits.</field><field name="mods.dateIssued">2005</field><field name="mods.yearIssued">2005</field><field name="mods.title.series">Preprints aus dem Institut für Mathematik</field><field name="allMeta">rosdok_id00005816</field><field name="allMeta">1986139832</field><field name="allMeta">Odv</field><field name="allMeta">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="allMeta">Preprints aus dem Institut für Mathematik</field><field name="allMeta">3255797-8</field><field name="allMeta">05/5</field><field name="allMeta">0005-0005</field><field name="mods.identifier.series">https://purl.uni-rostock.de/rosdok/id00005816</field><field name="mods.identifier.series">3255797-8</field><field name="mods.relatedItem"></field><field name="mods.relatedItem.series"></field><field name="mods.note.statement of responsibility">Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann</field><field name="ir.identifier">[xslt]Saxon</field><field name="recordIdentifier">rosdok_id00005895</field><field name="purl">https://purl.uni-rostock.de/rosdok/id00005895</field><field name="ppn">1987204301</field><field name="doi">10.18453/rosdok_id00005895</field><field name="urn">urn:nbn:de:gbv:28-rosdok_id00005895-3</field><field name="ir.creator.result">Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann</field><field name="ir.creator.sort">Engel Konrad, Kalinowski Thomas, Labahn Roger, Sill Frank, Timmermann Dirk</field><field name="ir.title.result">Optimization of dual-threshold circuits</field><field name="ir.doctype.result">Workingpaper</field><field name="ir.doctype_en.result">working paper</field><field name="ir.originInfo.result">University of Rostock,  Institute of Mathematics, 2005</field><field name="ir.abstract300.result">In this paper, we consider an optimization problem on directed acyclic graphs which is motivated by a standard task in low power VLSI design. With each vertex v of a directed acyclic graph, we associate two delay values d0(v) ≤ d1(v) and two leakage values c0(v) ≥ c1(v). The objective is to choose…</field><field name="ir.host.recordIdentifier">rosdok_id00005816</field><field name="ir.sortstring">0005-0005</field><field name="ir.seriesNumber.result">05/5</field><field name="ir.creator_all">Konrad Engel</field><field name="ir.creator_all">Thomas Kalinowski</field><field name="ir.creator_all">Roger Labahn</field><field name="ir.creator_all">Frank Sill</field><field name="ir.creator_all">Dirk Timmermann</field><field name="ir.title_all">Optimization of dual-threshold circuits</field><field name="ir.title_all">Preprints aus dem Institut für Mathematik</field><field name="ir.location_all">Universitätsbibliothek Rostock</field><field name="ir.location_all">https://purl.uni-rostock.de/rosdok/id00005895</field><field name="ir.creator_all">Konrad</field><field name="ir.creator_all">Engel</field><field name="ir.creator_all">1956 -</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">138612366</field><field name="ir.creator_all">Thomas</field><field name="ir.creator_all">Kalinowski</field><field name="ir.creator_all">1980 -</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">128420251</field><field name="ir.creator_all">0000-0002-8444-6848</field><field name="ir.creator_all">Roger</field><field name="ir.creator_all">Labahn</field><field name="ir.creator_all">1959 -</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">170999645</field><field name="ir.creator_all">0000-0003-1901-9644</field><field name="ir.creator_all">Frank</field><field name="ir.creator_all">Sill</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">Dirk</field><field name="ir.creator_all">Timmermann</field><field name="ir.creator_all">1957 -</field><field name="ir.creator_all"></field><field name="ir.creator_all">VerfasserIn</field><field name="ir.creator_all">aut</field><field name="ir.creator_all">132790505</field><field name="ir.creator_all">0000-0001-9267-9695</field><field name="ir.identifier">[purl]https://purl.uni-rostock.de/rosdok/id00005895</field><field name="ir.identifier">[urn]urn:nbn:de:gbv:28-rosdok_id00005895-3</field><field name="ir.identifier">[doi]10.18453/rosdok_id00005895</field><field name="ir.oai.setspec.open_access">open_access</field><field name="ir.pubyear_start">2005</field><field name="ir.pubyear_end">2005</field><field name="ir.epoch_class.facet">epoch:21th_century</field><field name="ir.language_class.facet">rfc5646:en</field><field name="ir.doctype_class.facet">doctype:epub.workingpaper</field><field name="ir.accesscondition_class.facet">accesscondition:openaccess</field><field name="ir.sdnb_class.facet">SDNB:510</field><field name="ir.institution_class.facet">institution:unirostock.mnf</field><field name="ir.state_class.facet">state:published</field></doc></add>