default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 96
Volume 96, Number 1, 16 October 2005
- Jywe-Fei Fang, Kuan-Chou Lai:
Embedding the incomplete hypercube in books. 1-6 - Dariusz Biernacki
, Olivier Danvy, Chung-chieh Shan:
On the dynamic extent of delimited continuations. 7-17 - Alberto Caprara, Ulrich Pferschy:
Modified subset sum heuristics for bin packing. 18-23 - Andrea Pietracaprina, Geppino Pucci:
Optimal many-to-one routing on the mesh with constant queues. 24-29 - Alain Finkel, Jérôme Leroux:
The convex hull of a regular set of integer vectors is polyhedral and effectively computable. 30-35 - K. Alagarsamy:
A mutual exclusion algorithm with optimally bounded bypasses. 36-40
Volume 96, Number 2, 31 October 2005
- Huaming Zhang, Xin He:
Visibility representation of plane graphs via canonical ordering tree, . 41-48 - Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas:
On the hamiltonicity of the cartesian product. 49-53 - Ferucio Laurentiu Tiplea, Dan C. Marinescu:
Structural soundness of workflow nets is decidable. 54-58 - Elmar Böhler, Steffen Reith, Henning Schnoor, Heribert Vollmer:
Bases for Boolean co-clones. 59-66 - Dieter Rautenbach:
Lower bounds on treespan. 67-70 - Rosario Gennaro, Mario Di Raimondo:
Secure multiplication of shared secrets in the exponent. 71-79
Volume 96, Number 3, 15 November 2005
- Jérôme Monnot:
The labeled perfect matching in bipartite graphs. 81-88 - Rocco A. Servedio, Andrew Wan:
Computing sparse permanents faster. 89-92 - Nikhil Srivastava, Alan D. Taylor:
Tight bounds on plurality. 93-95 - Sahadeo Padhye:
Partial known plaintext attack on Koyama scheme. 96-100 - Jianhua Zhao, Xuandong Li, Guoliang Zheng:
A quadratic-time DBM-based successor algorithm for checking timed automata. 101-105 - Yuriy A. Reznik:
On the average depth of asymmetric LC-tries. 106-113 - Swastik Kopparty, Chinya V. Ravishankar:
A framework for pursuit evasion games in Rn. 114-122
Volume 96, Number 4, 30 November 2005
- Jun-Ming Xu, Min Xu, Qiang Zhu:
The super connectivity of shuffle-cubes. 123-127 - Pangfeng Liu:
Minimum degree triangulation for rectangular domains. 128-135 - Min Xu, Jun-Ming Xu:
Edge-pancyclicity of Möbius cubes. 136-140 - Agostino Capponi, Concetta Pilotto:
Bounded families for the on-line t-relaxed coloring. 141-145 - Jun-Ming Xu, Zheng-Zhong Du, Min Xu:
Edge-fault-tolerant edge-bipancyclicity of hypercubes. 146-150 - Greg Aloupis, Erin McLeish:
A lower bound for computing Oja depth. 151-153
Volume 96, Number 5, 16 December 2005
- Tadao Takaoka:
An O(n3loglogn/logn) time algorithm for the all-pairs shortest path problem. 155-161 - Walter A. Burkhard:
Double hashing with passbits. 162-166 - Xianbing Wang, Yong Meng Teo, Jiannong Cao:
A bivalency proof of the lower bound for uniform consensus. 167-174 - Igor E. Shparlinski, Arne Winterhof:
On the linear complexity of bounded integer sequences over different moduli. 175-177 - Gonzalo Navarro, Nieves R. Brisaboa:
New bounds on D-ary optimal codes. 178-184 - Moritz G. Maaß, Johannes Nowak:
A new method for approximate indexing and dictionary lookup with one error. 185-191
Volume 96, Number 6, 31 December 2005
- Ali Sezgin, Ganesh Gopalakrishnan:
On the definition of sequential consistency. 193-196 - Kuan-Yu Chen, Kun-Mao Chao:
Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint. 197-201 - Stasys Jukna:
On the P versus NP intersected with co-NP question in communication complexity. 202-206 - Méziane Aïder, Mustapha Aouchiche:
Distance monotonicity and a new characterization of Hamming graphs. 207-213 - Eduardo Moreno:
De Bruijn sequences and De Bruijn graphs for a general language. 214-219 - Bostjan Slivnik, Bostjan Vilfan:
Producing the left parse during bottom-up parsing. 220-224 - Thuy Duong Vu:
The compression structure of a process. 225-229
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 2026-08-06 22:39 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
