Pascal and Francis Bibliographic Databases

Help

Search results

Your search

jo.\*:("Information processing letters")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 5278

  • Page / 212
Export

Selection :

  • and

A correspondence between type checking via reduction and type checking via evaluationSERGEY, Ilya; CLARKE, Dave.Information processing letters. 2012, Vol 112, Num 1-2, pp 13-20, issn 0020-0190, 8 p.Article

(Δ + 1 )-total-colorability of plane graphs of maximum degree Δ ≥ 6 with neither chordal 5-cycle nor chordal 6-cycleQIAN WU; QIULI LU; YINGQIAN WANG et al.Information processing letters. 2011, Vol 111, Num 15, pp 767-772, issn 0020-0190, 6 p.Article

A good characterization of squares of strongly chordal split graphsVAN BANG LE; NGOC TUY NGUYEN.Information processing letters. 2011, Vol 111, Num 3, pp 120-123, issn 0020-0190, 4 p.Article

A new fair scheduling algorithm for periodic tasks on multiprocessorsKIM, Heeheon; CHO, Yookun.Information processing letters. 2011, Vol 111, Num 7, pp 301-309, issn 0020-0190, 9 p.Article

A note on element-wise matrix sparsification via a matrix-valued Bernstein inequalityDRINEAS, Petros; ZOUZIAS, Anastasios.Information processing letters. 2011, Vol 111, Num 8, pp 385-389, issn 0020-0190, 5 p.Article

A note on exact distance labelingWEIMANN, Oren; PELEG, David.Information processing letters. 2011, Vol 111, Num 14, pp 671-673, issn 0020-0190, 3 p.Article

A note on improving the performance of approximation algorithms for radiation therapyBIEDL, Therese; DUROCHER, Stephane; HOOS, Holger H et al.Information processing letters. 2011, Vol 111, Num 7, pp 326-333, issn 0020-0190, 8 p.Article

A risk-reward model for the on-line leasing of depreciable equipmentYONG ZHANG; WEIGUO ZHANG; WEIJUN XU et al.Information processing letters. 2011, Vol 111, Num 6, pp 256-261, issn 0020-0190, 6 p.Article

A tighter upper bound for random MAX 2-SATXUELIN XU; ZONGSHENG GAO; KE XU et al.Information processing letters. 2011, Vol 111, Num 3, pp 115-119, issn 0020-0190, 5 p.Article

An efficient implementation of the equilibrium algorithm for housing markets with duplicate housesCECHLAROVA, Katarína; JELINKOVA, Eva.Information processing letters. 2011, Vol 111, Num 13, pp 667-670, issn 0020-0190, 4 p.Article

Approximating partition functions of the two-state spin systemJINSHAN ZHANG; HENG LIANG; FENGSHAN BAI et al.Information processing letters. 2011, Vol 111, Num 14, pp 702-710, issn 0020-0190, 9 p.Article

Comments on Generalized rate monotonic schedulability bounds using relative period ratiosPARK, Moonju.Information processing letters. 2011, Vol 111, Num 7, pp 334-337, issn 0020-0190, 4 p.Article

Conditional diagnosability of hypermeshes under the comparison modelERJIE YANG; XIAOFAN YANG; QIANG DONG et al.Information processing letters. 2011, Vol 111, Num 4, pp 188-193, issn 0020-0190, 6 p.Article

Counterexamples in infinitary rewriting with non-fully-extended rulesKETEMA, Jeroen.Information processing letters. 2011, Vol 111, Num 13, pp 642-646, issn 0020-0190, 5 p.Article

Covering and packing in linear spaceBJÖRKLUND, Andreas; HUSFELDT, Thore; KASKI, Petteri et al.Information processing letters. 2011, Vol 111, Num 21-22, pp 1033-1036, issn 0020-0190, 4 p.Article

Faster pairing computation on genus 2 hyperelliptic curvesCHUNMING TANG; MAOZHI XU; YANFENG QI et al.Information processing letters. 2011, Vol 111, Num 10, pp 494-499, issn 0020-0190, 6 p.Article

Holographic reduction for some counting problemsCHEN YUAN; HAIBIN KAN.Information processing letters. 2011, Vol 111, Num 15, pp 761-766, issn 0020-0190, 6 p.Article

How many oblivious robots can explore a lineFLOCCHINI, Paola; ILCINKAS, David; PELC, Andrzej et al.Information processing letters. 2011, Vol 111, Num 20, pp 1027-1031, issn 0020-0190, 5 p.Article

Low-level dichotomy for quantified constraint satisfaction problemsMARTIN, Barnaby.Information processing letters. 2011, Vol 111, Num 20, pp 999-1003, issn 0020-0190, 5 p.Article

Nondominated local coteries for resource allocation in grids and cloudsJIANG, Jehn-Ruey.Information processing letters. 2011, Vol 111, Num 8, pp 379-384, issn 0020-0190, 6 p.Article

Offline file assignments for online load balancingDÜTTING, Paul; HENZINGER, Monika; WEBER, Ingmar et al.Information processing letters. 2011, Vol 111, Num 4, pp 178-183, issn 0020-0190, 6 p.Article

On extending de Bruijn sequencesBECHER, Verónica; HEIBER, Pablo Ariel.Information processing letters. 2011, Vol 111, Num 18, pp 930-932, issn 0020-0190, 3 p.Article

On the average complexity for the verification of compatible sequencesKOUKOUVINOS, Christos; PILLWEIN, Veronika; SIMOS, Dimitris E et al.Information processing letters. 2011, Vol 111, Num 17, pp 825-830, issn 0020-0190, 6 p.Article

On the linear complexity of the Naor-Reingold sequenceGOMEZ, Domingo; GUTIERREZ, Jaime; IBEAS, Alvar et al.Information processing letters. 2011, Vol 111, Num 17, pp 854-856, issn 0020-0190, 3 p.Article

P-hardness of the emptiness problem for visibly pushdown languagesLANGE, Martin.Information processing letters. 2011, Vol 111, Num 7, pp 338-341, issn 0020-0190, 4 p.Article

  • Page / 212