10392 search results - page 1787 / 2079 » Introduction to Computer Science |
159
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
A union-find data structure maintains a collection of disjoint sets under makeset, union and find operations. Kaplan, Shafrir and Tarjan [SODA 2002] designed data structures for ...
184
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
The firing rule of Petri nets relies on a residuation operation for the commutative monoid of natural numbers. We identify a class of residuated commutative monoids, called Petri ...
182
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
171
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
145
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...