default search action
Mathematics in Computer Science, Volume 3
Volume 3, Number 1, March 2010
- Mirka Miller, Koichi Wada:
Foreword. 1-2 - Matthias Baumgart:
Partitioning Bispanning Graphs into Spanning Trees. 3-15 - Johannes Fischer, Volker Heun:
Finding Range Minima in the Middle: Approximations and Applications. 17-30 - Satoshi Fujita:
Loose Cover of Graphs. 31-38 - Rikio Ichishima, Akito Oshima:
On Partitional Labelings of Graphs. 39-45 - Reinhard Kutzelnigg:
An Improved Version of Cuckoo Hashing: Average Case Analysis of Construction Cost and Search Operations. 47-60 - Sof Anthony Lee:
k-Phase Oscillator Synchronization for Graph Coloring. 61-72 - George B. Mertzios, Walter Unger:
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time. 73-84 - George B. Mertzios, Walter Unger:
An Optimal Algorithm for the k-Fixed-Endpoint Path Cover on Proper Interval Graphs. 85-96 - Balasubramanian Sivan, S. Harini, C. Pandu Rangan:
On Conditional Covering Problem. 97-107 - Yuuki Tanaka, Yukio Shibata:
On the Pagenumber of the Cube-Connected Cycles. 109-117 - Jianmin Tang, Yuqing Lin
, Mirka Miller:
New Results on EX Graphs. 119-126
Volume 3, Number 2, April 2010
- Jean-Charles Faugère, Ludovic Perret:
Foreword. 127-128 - Ayoub Otmani
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes. 129-140 - Clemens Heuberger:
Redundant τ-Adic Expansions II: Non-Optimality and Chaotic Behaviour. 141-157 - Tobias Eibach, Gunnar Völkel, Enrico Pilz:
Optimising Gröbner Bases on Bivium. 159-172 - Sylvain Duquesne:
Traces of the Group Law on the Kummer Surface of a Curve of Genus 2 in Characteristic 2. 173-183 - Stanislav Bulygin, Michael Brickenstein:
Obtaining and Solving Systems of Equations in Key Variables Only for the Small Variants of AES. 185-200 - Moon Sung Lee, Sang Geun Hahn:
Cryptanalysis of the GGH Cryptosystem. 201-208 - Moritz Minzlaff:
Computing Zeta Functions of Superelliptic Curves in Larger Characteristic. 209-224
Volume 3, Number 3, May 2010
- Serge Autexier
Foreword to the Special Issue on Authoring, Digitalization and Management of Mathematical Knowledge. 225-226 - Thierry Bouche
Digital Mathematics Libraries: The Good, the Bad, the Ugly. 227-241 - Enrique Macías-Virgós, R. de la Viesca:
Digitization Projects in Spain. 243-250 - Zarko Mijajlovic, Zoran Ognjanovic, Aleksandar Pejovic:
Digitization of Mathematical Editions in Serbia. 251-263 - Katarzyna Zamlynska, Alek Tarkowski, Tomasz Rosiek:
Evolution of the Mathematical Collection of the Polish Virtual Library of Science. 265-278 - Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida
Grammatical Verification for Mathematical Formula Recognition Based on Context-Free Tree Grammar. 279-298 - Heinrich Stamerjohanns, Michael Kohlhase
Transforming Large Collections of Scientific Publications to XML. 299-307 - David Aspinall, Ewen Denney, Christoph Lüth:
Tactics for Hierarchical Proof. 309-330 - Arjeh M. Cohen, Hans Cuypers, R. Verrijzer:
Mathematical Context in Interactive Documents. 331-347 - Bastiaan Heeren, Johan Jeuring, Alex Gerdes:
Specifying Rewrite Strategies for Interactive Exercises. 349-370
Volume 3, Number 4, June 2010
- Manolis Christodoulakis, Costas S. Iliopoulos:
Foreword. 371 - Simon J. Puglisi, William F. Smyth, Munina Yusufu:
Fast, Practical Algorithms for Computing All the Repeats in a String. 373-389 - Luigi Cinque, Sergio De Agostino, Luca Lombardi:
Scalability and Communication in Parallel Low-Complexity Lossless Compression. 391-406 - M. Oguzhan Külekci
BLIM: A New Bit-Parallel Pattern Matching Algorithm Overcoming Computer Word Size Limitation. 407-420 - Subhas Kumar Ghosh, Janardan Misra:
A Randomized Algorithm for 3-SAT. 421-431 - Masud Hasan, Tanaeem M. Moosa, M. Sohel Rahman
Cache Oblivious Algorithms for the RMQ and the RMSQ Problems. 433-442 - Ida M. Pu, Yuji Shen:
Analytical Studies of Energy-Time Efficiency of Blocking Expanding Ring Search. 443-456 - Elena S. Dimitrova:
Estimating the Volumes of the Cones in a Gröbner Fan. 457-463 - Andreas Alexander Albrecht, Peter C. R. Lane, Kathleen Steinhöfel
Analysis of Local Search Landscapes for k-SAT Instances. 465-488 - Colin Cooper, Ryuhei Uehara
Scale Free Properties of Random k-Trees. 489-496
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-14 21:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: