Theoretical Computer Science

Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...

Klaas Sikkel

claim paper

Read More »

43

click to vote

TCS
1998

91views Theoretical Computer Science» more TCS 1998»

Foundations of Aggregation Constraints

13 years 11 months ago

Download www.cse.iitb.ac.in

We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...

Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...

claim paper

Read More »

33

click to vote

TCS
1998

83views Theoretical Computer Science» more TCS 1998»

A Hierarchy Based on Output Multiplicity

13 years 11 months ago

Download www.cse.buffalo.edu

Ashish V. Naik, John D. Rogers, James S. Royer, Al...

claim paper

Read More »

32

click to vote

TCS
1998

100views Theoretical Computer Science» more TCS 1998»

Dynamical Recognizers: Real-Time Language Recognition by Analog Computers

13 years 11 months ago

Download www.santafe.edu

We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...

Cristopher Moore

claim paper

Read More »

32

click to vote

TCS
1998

78views Theoretical Computer Science» more TCS 1998»

TWDM Multichannel Lightwave Hypercube Networks

13 years 11 months ago

Download www.cs.iit.edu

The hypercube is a widely used interconnection topology as it presents a lot of attractive properties. Recently, the hypercube has been proposed as a virtual topology for TWDM mul...

Peng-Jun Wan

claim paper

Read More »

34

click to vote

TCS
1998

122views Theoretical Computer Science» more TCS 1998»

Contributions of Ronald V. Book to the Theory of String-Rewriting Systems

13 years 11 months ago

Download www.cs.rpi.edu

Robert McNaughton

claim paper

Read More »

33

click to vote

TCS
1998

108views Theoretical Computer Science» more TCS 1998»

Bubbles in Modularity

13 years 11 months ago

Download www.w3.org

We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...

Massimo Marchiori

claim paper

Read More »

22

click to vote

TCS
1998

76views Theoretical Computer Science» more TCS 1998»

k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion

13 years 11 months ago

Download hal.archives-ouvertes.fr

Yoshifumi Manabe, Roberto Baldoni, Michel Raynal, ...

claim paper

Read More »

30

click to vote

TCS
1998

85views Theoretical Computer Science» more TCS 1998»

ERCW PRAMs and Optical Communication

13 years 11 months ago

Download www.cs.utexas.edu

This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...

Philip D. MacKenzie, Vijaya Ramachandran

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers