Sciweavers

17920 search results - page 337 / 3584
» Recentering computer science
Sort
View
CSR
2007
Springer
16 years 27 days ago
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
Abstract It has recently been proved (Je˙z, DLT 2007) that conjunctive grammars (that is, context-free grammars augmented by conjunction) generate some nonregular languages over a...
Artur Jez, Alexander Okhotin
ICTCS
2005
Springer
16 years 6 days ago
A Typed Semantics of Higher-Order Store and Subtyping
Abstract. We consider a call-by-value language, with higher-order functions, records, references to values of arbitrary type, and subtyping. We adapt an intrinsic denotational mode...
Jan Schwinghammer
ICALP
2003
Springer
15 years 12 months ago
Generating Labeled Planar Graphs Uniformly at Random
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
CRYPTOLOGIA
2006
67views more  CRYPTOLOGIA 2006»
15 years 6 months ago
Underwater Hacker Missile Wars: A Cryptography and Engineering Contest
For a recent student conference, the authors developed a day-long design problem and competition suitable for engineering, mathematics, and science undergraduates. The competition ...
Joshua Holden, Richard Layton, Laurence D. Merkle,...