This text presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MCFS '95, held in Prague, Czech Republic in August/September 1995. The text contains a variety of papers which outline relevant aspects of theoretical computer science. The papers are organized in sections on: structural complexity; algorithms; complexity theory; graphs in models of computation; lower bounds; formal languages; unification; rewriting and type theory; distributed computation; concurrency; semantics; model checking; and formal calculi.We will consider a technique called a#39;interval routinga#39; and show that for general networks it is not likely to be very effective. Interval routing is based on a suitable naming scheme for the nodes and edges in a network. A node label is anyanbsp;...
|Title||:||Mathematical Foundations of Computer Science 1995|
|Author||:||Jiri Wiedermann, Petr Hájek|
|Publisher||:||Springer Science & Business Media - 1995-08-16|