Name
Title | ||
|---|---|---|
A polynomial-time algorithm for deciding equivalence of normed context-free processes |
Abstract | ||
|---|---|---|
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, ... |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1109/SFCS.1994.365729 | Santa Fe, NM |
Keywords | Field | DocType |
high performance computing,normed context-free process,communication system,admission control,numerous application,polynomial-time algorithm,virtual circuit routing,virtual circuit,computer science,production,context free grammars,equivalence classes,polynomials,equivalence,mathematics,polynomial time,context free grammar,decidability,carbon capture and storage,algebra | Rule-based machine translation,Discrete mathematics,Combinatorics,Context-free grammar,Polynomial,Algorithm,Decidability,Equivalence (measure theory),Equivalence class,Corollary,Time complexity,Mathematics | Conference |
ISSN | ISBN | Citations |
0272-5428 | 0-8186-6580-7 | 12 |
PageRank | References | Authors |
1.85 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yoram Hirshfeld | 1 | 427 | 35.59 |
| JerrumMark | 2 | 199 | 33.55 |
| Moller, F. | 3 | 12 | 1.85 |