Algorithms solving path systems

Bogdan S. Chlebus

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Al gorithms recognizing solvable path systems are presented and their time complexity is investigated. Among them there is an algorithm with a constant expected behaviour.

Original languageEnglish (US)
Title of host publicationFundamentals of Computation Theory - FCT 1985
EditorsLothar Budach
PublisherSpringer Verlag
Pages70-79
Number of pages10
ISBN (Print)9783540156895
DOIs
StatePublished - Jan 1 1985
Externally publishedYes
Event5th International Conference on Fundamentals of Computation Theory, FCT 1985 - Cottbus, Germany
Duration: Sep 9 1985Sep 13 1985

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume199 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Conference on Fundamentals of Computation Theory, FCT 1985
CountryGermany
CityCottbus
Period9/9/859/13/85

Fingerprint

Time Complexity
Path

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S. (1985). Algorithms solving path systems. In L. Budach (Ed.), Fundamentals of Computation Theory - FCT 1985 (pp. 70-79). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 199 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0028793

Algorithms solving path systems. / Chlebus, Bogdan S.

Fundamentals of Computation Theory - FCT 1985. ed. / Lothar Budach. Springer Verlag, 1985. p. 70-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 199 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chlebus, BS 1985, Algorithms solving path systems. in L Budach (ed.), Fundamentals of Computation Theory - FCT 1985. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 199 LNCS, Springer Verlag, pp. 70-79, 5th International Conference on Fundamentals of Computation Theory, FCT 1985, Cottbus, Germany, 9/9/85. https://doi.org/10.1007/BFb0028793
Chlebus BS. Algorithms solving path systems. In Budach L, editor, Fundamentals of Computation Theory - FCT 1985. Springer Verlag. 1985. p. 70-79. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0028793
Chlebus, Bogdan S. / Algorithms solving path systems. Fundamentals of Computation Theory - FCT 1985. editor / Lothar Budach. Springer Verlag, 1985. pp. 70-79 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b918920cdba1499e81eee666426363e7,
title = "Algorithms solving path systems",
abstract = "Al gorithms recognizing solvable path systems are presented and their time complexity is investigated. Among them there is an algorithm with a constant expected behaviour.",
author = "Chlebus, {Bogdan S.}",
year = "1985",
month = "1",
day = "1",
doi = "10.1007/BFb0028793",
language = "English (US)",
isbn = "9783540156895",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "70--79",
editor = "Lothar Budach",
booktitle = "Fundamentals of Computation Theory - FCT 1985",

}

TY - GEN

T1 - Algorithms solving path systems

AU - Chlebus, Bogdan S.

PY - 1985/1/1

Y1 - 1985/1/1

N2 - Al gorithms recognizing solvable path systems are presented and their time complexity is investigated. Among them there is an algorithm with a constant expected behaviour.

AB - Al gorithms recognizing solvable path systems are presented and their time complexity is investigated. Among them there is an algorithm with a constant expected behaviour.

UR - http://www.scopus.com/inward/record.url?scp=85034435026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85034435026&partnerID=8YFLogxK

U2 - 10.1007/BFb0028793

DO - 10.1007/BFb0028793

M3 - Conference contribution

AN - SCOPUS:85034435026

SN - 9783540156895

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 70

EP - 79

BT - Fundamentals of Computation Theory - FCT 1985

A2 - Budach, Lothar

PB - Springer Verlag

ER -