default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 108
Volume 108, Number 1, September 2008
- Yohan Boichut, Pierre-Cyrille Héam:
A theoretical limit for safety verification techniques with regular fix-point computations. 1-2 - Xiang Zhou:
Ehrenfeucht-Fraïssé games in finite set theory. 3-9 - Henning Bordihn, Markus Holzer
:
A note on cooperating distributed grammar systems working in combined modes. 10-14 - Reuven Cohen, Liran Katzir:
The Generalized Maximum Coverage Problem. 15-22 - Manfred Droste, Jacques Sakarovitch, Heiko Vogler:
Weighted automata with discounting. 23-28 - Maria Liazi, Ioannis Milis, Vassilis Zissimopoulos:
A constant approximation algorithm for the densest k. 29-32 - Sung-Hwa Lim, Byoung-Hoon Lee, Jai-Hoon Kim:
Diversity and fault avoidance for dependable replication systems. 33-37 - Ulrich M. Schwarz:
Online scheduling on semi-related machines. 38-40 - Vladimir Yanovski:
Approximation algorithm for coloring of dotted interval graphs. 41-44
Volume 108, Number 2, September 2008
- Kai Puolamäki, Sami Hanhijärvi, Gemma C. Garriga:
An approximation ratio for biclustering. 45-49 - Eduardo Tavares, Paulo Romero Martins Maciel, Bruno Silva, Meuse N. Oliveira Jr.:
Hard real-time tasks' scheduling considering voltage scaling, precedence and exclusion relations. 50-59 - Valentin Ziegler:
Approximation algorithms for restricted Bayesian network structures. 60-63 - Sebastian Czerwinski, Jaroslaw Grytczuk:
Invisible runners in finite fields. 64-67 - Tomás Masopust:
Descriptional complexity of multi-parallel grammars. 68-70 - Stefan Göller:
Reachability on prefix-recognizable graphs. 71-74 - Razvan Diaconescu:
A categorical study on the finiteness of specifications. 75-80 - Sun-Yuan Hsieh:
A note on cycle embedding in folded hypercubes with faulty elements. 81 - Pascal Ochem, Alexandre Pinlou:
Oriented colorings of partial 2-trees. 82-86
Volume 108, Number 3, October 2008
- Deqiang Wang, Yu-Peng Wen, Kelun Wang:
A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable. 87-89 - Juan Liu, Jixiang Meng:
Super-connected and super-arc-connected Cartesian product of digraphs. 90-93 - Gabriela F. Minetti, Enrique Alba, Gabriel Luque:
Seeding strategies and recombination operators for solving the DNA fragment assembly problem. 94-100 - Marjan Hericko, Ales Zivkovic, Ivan Rozman:
An approach to optimizing software development team size. 101-106 - Kung-Jui Pai, Jou-Ming Chang, Yue-Li Wang:
A Note on "An improved upper bound on the queuenumber of the hypercube". 107-109 - Li Jiao:
A note on regular Petri nets. 110-114 - Vesa Halava, Tero Harju, Mika Hirvensalo, Juhani Karhumäki:
Post Correspondence Problem for short words. 115-118 - Akka Zemmari:
On handshakes in random graphs. 119-123 - Sylvain Lavallée:
I-rationality of a certain class of formal series. 124-126 - Brad Long:
Managing module dependencies to facilitate continuous testing. 127-131 - Salim Haddadi, Layouni Zoubir:
Consecutive block minimization is 1.5-approximable. 132-135 - Rajesh Bordawekar, Oded Shmueli:
An algorithm for partitioning trees augmented with sibling edges. 136-142 - Julia Böttcher, Dan Vilenchik:
On the tractability of coloring semirandom graphs. 143-149 - Raquel Viaña:
Quick encoding of plane graphs in log214 bits per edge. 150-154 - Hiroshi Fujiwara, Kazuo Iwama, Kouki Yonezawa:
Online chasing problems for regular polygons. 155-159 - Sergio Rajsbaum, Michel Raynal, Corentin Travers:
An impossibility about failure detectors in the iterated immediate snapshot model. 160-164 - Joanna Skowronek-Kaziów:
Some digraphs arising from number theory and remarks on the zero-divisor graph of the ring Z. 165-169
Volume 108, Number 4, October 2008
- Min Ji, T. C. Edwin Cheng:
An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan. 171-174 - Claire Mathieu, Charalampos Papamanthou:
Distortion lower bounds for line embeddings. 175-178 - Rainer Steinwandt, Viktória I. Villányi:
A one-time signature using run-length encoding. 179-185 - Pierre Charbit, Michel Habib, Vincent Limouzy, Fabien de Montgolfier, Mathieu Raffinot, Michaël Rao:
A note on computing set overlap classes. 186-191 - Jyhjong Lin:
A conceptual model for negotiating in service-oriented environments. 192-203 - Changsheng Zhang, Jigui Sun, Xingjun Zhu, Qingyun Yang:
An improved particle swarm optimization algorithm for flowshop scheduling problem. 204-209 - Prosenjit Bose, Hua Guo, Evangelos Kranakis, Anil Maheshwari, Pat Morin, Jason Morrison, Michiel H. M. Smid, Yihui Tang:
On the false-positive rate of Bloom filters. 210-213 - Stanley P. Y. Fung:
Lower bounds on online deadline scheduling with preemption penalties. 214-218 - Pauli Miettinen:
On the Positive-Negative Partial Set Cover problem. 219-221 - Volker Heun:
Analysis of a modification of Gusfield's recursive algorithm for reconstructing ultrametric trees. 222-225 - Tracy Grauman, Stephen G. Hartke, Adam S. Jobson, William B. Kinnersley, Douglas B. West, Lesley Wiglesworth, Pratik Worah, Hehui Wu:
The hub number of a graph. 226-228 - Yasuhiko Takenaga, Shigeru Arai:
PSPACE-completeness of an escape problem. 229-233 - Ricardo dos Santos Carvalho, Carlile Lavor, Fábio Protti:
Extending the geometric build-up algorithm for the molecular distance geometry problem. 234-237 - Martin Kochol, Nad'a Krivonáková, Silvia Smejová, Katarína Sranková:
Complexity of approximation of 3-edge-coloring of graphs. 238-241 - Pierre-Cyrille Héam:
A note on partially ordered tree automata. 242-246 - Mitre Costa Dourado, Min Chih Lin, Fábio Protti, Jayme Luiz Szwarcfiter:
Improved algorithms for recognizing p. 247-250 - Dekel Tsur:
Faster algorithms for guided tree edit distance. 251-254
Volume 108, Number 5, November 2008
- Louis Esperet, Arnaud Labourel, Pascal Ochem:
On induced-universal graphs for the class of bounded-degree graphs. 255-260 - Jung-Sheng Fu:
Fault-free cycles in folded hypercubes with more faulty elements. 261-263 - Sándor Vágvölgyi:
Murg term rewrite systems. 264-272 - Christian Boulinier, Ajoy Kumar Datta, Lawrence L. Larmore, Franck Petit:
Space efficient and time optimal distributed BFS tree construction. 273-278 - David Galindo, Javier Herranz:
On the security of public key cryptosystems with a double decryption mechanism. 279-283 - Luca Aceto, Silvio Capobianco, Anna Ingólfsdóttir, Bas Luttik:
The equational theory of prebisimilarity over basic CCS with divergence. 284-289 - Vesa Halava, Tero Harju, Tomi Kärki:
Square-free partial words. 290-292 - Bishnu Bhattacharyya, Frank K. H. A. Dehne:
Using spine decompositions to efficiently solve the length-constrained heaviest path problem for trees. 293-297 - Rod Downey, Noam Greenberg:
Turing degrees of reals of positive effective packing dimension. 298-303 - Álvar Ibeas Martín:
On the period of the Naor-Reingold sequence. 304-307 - Martin Lange:
A purely model-theoretic proof of the exponential succinctness gap between CTL+ and CTL. 308-312 - Heikki Hyyrö:
Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching. 313-319 - Maxime Crochemore, Costas S. Iliopoulos, Mohammad Sohel Rahman:
Optimal prefix and suffix queries on texts. 320-325 - Chia-Jui Lai, Chang-Hsiung Tsai:
Embedding a family of meshes into twisted cubes. 326-330 - Jinsong Tan:
A note on the inapproximability of correlation clustering. 331-335 - Fokko J. van de Bult, Gerhard J. Woeginger:
The problem of the moody chess players. 336-337
Volume 108, Number 6, November 2008
- Taek-Young Youn, Young-Ho Park, Chang Han Kim, Jongin Lim:
Weakness in a RSA-based password authenticated key exchange protocol. 339-342 - Arindam Karmakar, Sasanka Roy, Sandip Das:
Fast computation of smallest enclosing circle with center on a query line segment. 343-346 - Bin Liu, Jianfeng Hou, Guizhen Liu:
List edge and list total colorings of planar graphs without short cycles. 347-351 - Travis Gagie:
Dynamic asymmetric communication. 352-355 - Fethi Jarray, Marie-Christine Costa, Christophe Picouleau:
Complexity results for the horizontal bar packing problem. 356-359 - Hsing-Yen Ann, Chang-Biau Yang, Chiou-Ting Tseng, Chiou-Yi Hor:
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings. 360-364 - Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz:
Ski rental with two general options. 365-368 - Xiaotie Deng, Ye Du:
The computation of approximate competitive equilibrium is PPAD-hard. 369-373 - Peter Massuthe, Alexander Serebrenik, Natalia Sidorova, Karsten Wolf:
Can I find a partner? Undecidability of partner existence for open nets. 374-378 - Yusu Wang:
Approximating nearest neighbor among triangles in convex position. 379-385 - Shiying Wang, Shangwei Lin:
lambda. 386-389 - Ariel D. Procaccia:
A note on the query complexity of the Condorcet winner problem. 390-393 - Qiang Dong, Xiaofan Yang, Juan Zhao:
Embedding a family of disjoint multi-dimensional meshes into a crossed cube. 394-397 - Xuegong Tan, Shun-Zheng Yu, Jin Han Park:
A note about some properties of BC graphs. 398-401 - Petr Gregor, Tomás Dvorák:
Path partitions of hypercubes. 402-406 - Amos Israeli, Oran Sharon:
An approximation algorithm for sequential rectangle placement. 407-411 - Anna Fiedorowicz, Mariusz Haluszczak, Narayanan Narayanan:
About acyclic edge colourings of planar graphs. 412-417 - Travis Gagie:
Sorting streamed multisets. 418-421
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-11-28 23:54 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:
