UnivTrevesV1, LNCS, Analysis, bibRecord, 000288

Lower bounds for the majority communication complexity of various graph accessibility problems

Identifieur interne : 000288 ( LNCS/Analysis ); précédent : 000287; suivant : 000289

Lower bounds for the majority communication complexity of various graph accessibility problems

Auteurs : Christoph Meinel [Allemagne] ; Stephan Waack

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 1995.

RBID : ISTEX:AC6C290A46839A39813AA8C3BE3EB79F5F2C9178
Url:

DOI: 10.1007/3-540-60246-1_136

Affiliations:

Links to Exploration step

ISTEX:AC6C290A46839A39813AA8C3BE3EB79F5F2C9178

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Lower bounds for the majority communication complexity of various graph accessibility problems</title>
<author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name>
<affiliation><country>Allemagne</country>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
<author><name sortKey="Waack, Stephan" sort="Waack, Stephan" uniqKey="Waack S" first="Stephan" last="Waack">Stephan Waack</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:AC6C290A46839A39813AA8C3BE3EB79F5F2C9178</idno>
<date when="1995" year="1995">1995</date>
<idno type="doi">10.1007/3-540-60246-1_136</idno>
<idno type="url">https://api.istex.fr/document/AC6C290A46839A39813AA8C3BE3EB79F5F2C9178/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000941</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000941</idno>
<idno type="wicri:Area/Istex/Curation">000889</idno>
<idno type="wicri:Area/Istex/Checkpoint">001150</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001150</idno>
<idno type="wicri:doubleKey">0302-9743:1995:Meinel C:lower:bounds:for</idno>
<idno type="wicri:Area/Main/Merge">002E55</idno>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:D9B2BCFCF8E1CAA608E9808C8CBEE49C06CFFEB8</idno>
<idno type="url">https://api.istex.fr/document/D9B2BCFCF8E1CAA608E9808C8CBEE49C06CFFEB8/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000C30</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000C30</idno>
<idno type="wicri:Area/Istex/Curation">000B57</idno>
<idno type="wicri:Area/Istex/Checkpoint">001149</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001149</idno>
<idno type="wicri:doubleKey">0302-9743:1995:Meinel C:lower:bounds:for</idno>
<idno type="wicri:Area/Main/Merge">002E54</idno>
<idno type="wicri:Area/Main/Curation">002951</idno>
<idno type="wicri:Area/Main/Exploration">002951</idno>
<idno type="wicri:Area/LNCS/Extraction">000288</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Lower bounds for the majority communication complexity of various graph accessibility problems</title>
<author><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name>
<affiliation><wicri:noCountry code="subField">Trier</wicri:noCountry>
<country>Allemagne</country>
<placeName><settlement type="city">Trèves (Allemagne)</settlement>
<region type="land" nuts="1">Rhénanie-Palatinat</region>
</placeName>
<orgName type="university">Université de Trèves</orgName>
</affiliation>
</author>
<author><name sortKey="Waack, Stephan" sort="Waack, Stephan" uniqKey="Waack S" first="Stephan" last="Waack">Stephan Waack</name>
<affiliation><wicri:noCountry code="subField">Göttingen</wicri:noCountry>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>1995</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">AC6C290A46839A39813AA8C3BE3EB79F5F2C9178</idno>
<idno type="DOI">10.1007/3-540-60246-1_136</idno>
<idno type="ChapterID">28</idno>
<idno type="ChapterID">Chap28</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
</TEI>
<affiliations><list><country><li>Allemagne</li>
</country>
<region><li>Rhénanie-Palatinat</li>
</region>
<settlement><li>Trèves (Allemagne)</li>
</settlement>
<orgName><li>Université de Trèves</li>
</orgName>
</list>
<tree><noCountry><name sortKey="Waack, Stephan" sort="Waack, Stephan" uniqKey="Waack S" first="Stephan" last="Waack">Stephan Waack</name>
</noCountry>
<country name="Allemagne"><region name="Rhénanie-Palatinat"><name sortKey="Meinel, Christoph" sort="Meinel, Christoph" uniqKey="Meinel C" first="Christoph" last="Meinel">Christoph Meinel</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000288 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000288 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    LNCS
   |étape=   Analysis
   |type=    RBID
   |clé=     ISTEX:AC6C290A46839A39813AA8C3BE3EB79F5F2C9178
   |texte=   Lower bounds for the majority communication complexity of various graph accessibility problems
}}

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024

Serveur d'exploration sur l'Université de Trèves

Lower bounds for the majority communication complexity of various graph accessibility problems

Lower bounds for the majority communication complexity of various graph accessibility problems

Source :

Links toward previous steps (curation, corpus...)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur l'Université de Trèves
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.