TCS 1998 - PDF Preprint Papers

TCS 1998 International Conference on Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCS-1998 Paper

click to vote

TCS
1998

175views Theoretical Computer Science» more TCS 1998»

Algebraic Translations, Correctness and Algebraic Compiler Construction

14 years 2 days ago

Download www.cs.uiowa.edu

Algebraic translation methods are argued for in many ﬁelds of science. Several examples will be considered: from the ﬁeld of compiler construction, database updates, concurren...

Theo M. V. Janssen

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	175	Algebraic Translations, Correctness and Algebraic Compiler Construction	claim
2	154	On Competitive On-Line Paging with Lookahead	claim
3	122	Contributions of Ronald V. Book to the Theory of String-Rewriting Systems	claim
4	115	Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs	claim
5	113	Unary PCF is Decidable	claim
6	108	Bubbles in Modularity	claim
7	106	Decidability of Bisimulation Equivalence for Normed Pushdown Processes	claim
8	104	Axiomatisation of Functional Dependencies in Incomplete Relations	claim
9	103	Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory	claim
10	103	A Partial k-Arboretum of Graphs with Bounded Treewidth	claim
11	103	Proving Possibility Properties	claim
12	102	Counting Non-Isomorphic Chord Diagrams	claim
13	102	An Improved Zero-One Law for Algorithmically Random Sequences	claim
14	100	Dynamical Recognizers: Real-Time Language Recognition by Analog Computers	claim
15	100	Parsing Schemata and Correctness of Parsing Algorithms	claim
16	96	Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete	claim
17	92	Merit Factors and Morse Sequences	claim
18	91	Foundations of Aggregation Constraints	claim
19	87	A Uniform Approach to Semi-Dynamic Problems on Digraphs	claim
20	85	Terminal Metric Spaces of Finitely Branching and Image Finite Linear Processes	claim
21	85	Threshold Dominating Sets and an Improved Characterization of W[2]	claim
22	85	ERCW PRAMs and Optical Communication	claim
23	84	Continued Fraction Algorithms, Functional Operators, and Structure Constants	claim
24	83	A Hierarchy Based on Output Multiplicity	claim
25	80	Parameterized Circuit Complexity and the W Hierarchy	claim
26	79	Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds	claim
27	78	Near-Optimal, Distributed Edge Colouring via the Nibble Method	claim
28	78	TWDM Multichannel Lightwave Hypercube Networks	claim
29	76	Some Chip Transfer Games	claim
30	76	k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion	claim
31	72	A Computational Model for Metric Spaces	claim
32	71	Parallel Transient Time of One-Dimensional Sand Pile	claim
33	68	Open Maps, Behavioural Equivalences, and Congruences	claim
34	62	The Quotient of an Abstract Interpretation	claim
35	58	On the Relative Sizes of Learnable Sets	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers