7661 search results - page 205 / 1533 » Languages and the Computing Profession |
150
click to vote
ECOOPW
2004
Springer
15 years 12 months ago
2004
Springer
This report summarizes the Fifth Workshop on Programming Languages and Operating Systems (PLOS 2009), which was held in conjunction with the SOSP 2009 conference. This report pres...
156
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We consider the Edit distance with moves on the class of words and the class of ordered trees. We first exhibit a simple tester for the class of regular languages on words and gen...
155
click to vote
BALT
2006
15 years 10 months ago
2006
In philosophy, the term ontology has been used since the 17th century to refer both to a philosophical discipline (Ontology with a capital "O"), and as a domain-independe...
172
click to vote
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
179
click to vote
ECCC
2007
15 years 6 months ago
2007
We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then ¯L ∈ MA. Assuming the polynomial hierarch...