| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yue Li, Joe Sawada |
Gray codes for reflectable languages.   |
Inf. Process. Lett.  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin Ziegler |
Approximating optimum branchings in linear time. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Noam Livne |
A note on I-completeness of NP-witnessing relations. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Petersen, Szymon Grabowski |
Range mode and range median queries in constant time and sub-quadratic space. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Majewski, Nicholas Pippenger |
Attribute estimation and testing quasi-symmetry. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chih-Huai Cheng, Hsiao-Fei Liu, Kun-Mao Chao |
Optimal algorithms for the average-constrained maximum-sum segment problem. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chi-Hung Tzeng, Jehn-Ruey Jiang, Shing-Tsaan Huang |
A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pascal Schweitzer |
Using the incompressibility method to obtain local lemma results for Ramsey-type problems. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Víctor Dalmau |
There are no pure relational width 2 constraint satisfaction problems. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Kasperski, Pawel Zielinski |
On the approximability of minmax (regret) network optimization problems. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing Huang, Haina Sun, Weifan Wang, Dong Chen |
(2, 1)-Total labelling of trees with sparse vertices of maximum degree. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi |
Deterministically testing sparse polynomial identities of unbounded degree. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiuchuan Jiang, Xiaojun Xia |
Prominence convergence in the collective synchronization of situated multi-agents. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xin Han, He Guo, Dawei Yin, Yong Zhang |
A note on on-line broadcast scheduling with deadlines. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Edo Liberty, Steven W. Zucker |
The Mailman algorithm: A note on matrix-vector multiplication. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Esther M. Arkin, Sang Won Bae, Alon Efrat, Kazuya Okamoto, Joseph S. B. Mitchell, Valentin Polishchuk |
Geometric stable roommates. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Carlos S. Subi |
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mukul S. Bansal, David Fernández-Baca |
Computing distances between partial rankings. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
A nondeterministic space-time tradeoff for linear codes. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sarah Novotny, Juan Ortiz, Darren A. Narayan |
Minimal k. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mira Gonen, Yuval Shavitt |
A Theta(logn. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chaim Linhart, Ron Shamir |
Matching with don't-cares and a small number of mismatches. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas |
Faster multi-witnesses for Boolean matrix multiplication. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Virginia Vassilevska |
Efficient algorithms for clique problems. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongbo Hua, Yaoping Hou |
On graphs with the third largest number of maximal independent sets. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjay Jain |
On some open problems in reflective inductive inference. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Garth Isaak, Robert E. Jamison, Darren A. Narayan |
Greedy rankings and arank numbers. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yilun Shang |
Connectivity in a random interval graph with access points. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryo Yoshinaka |
An elementary proof of a generalization of double Greibach normal form. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat |
Clean the graph before you draw it! |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Maßberg, Dieter Rautenbach |
Binary trees with choosable edge lengths. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Liuling Dai |
An aggressive algorithm for multiple string matching. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daegun Ma, Jin Hong |
Success probability of the Hellman trade-off. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Wu, R. Wei |
Comments on "Distributed symmetric key management for mobile ad hoc networks". |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ananya Das, Charles U. Martel |
Stochastic shortest path with unlimited hops. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kewen Zhao, Yue Lin, Ping Zhang |
A sufficient condition for pancyclic graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomás Feder, Rajeev Motwani |
On the graph turnpike problem. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Karim Abu-Affash, Matthew J. Katz |
Improved bounds on the average distance to the Fermat-Weber center of a convex object. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amihood Amir, Gonzalo Navarro |
Parameterized matching on non-linear structures. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henk Meijer, Yurai Núñez Rodríguez, David Rappaport |
An algorithm for computing simple k-factors. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Dankelmann, Lutz Volkmann |
Minimum size of a graph or digraph of given radius. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Meijie Ma, Xuegong Tan, Jun-Ming Xu, Guizhen Liu |
A note on "The super connectivity of augmented cubes". |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jovan Dj. Golic, Guglielmo Morgari |
Optimal correlation attack on the multiplexer generator. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joachim Spoerhase, Hans-Christoph Wirth |
An O(n(logn)2/loglogn) algorithm for the single maximum coverage location or the (1, Xp)-medianoid problem on trees. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gösta Grahne, Alex Thomo |
Bounded regular path queries in view-based data integration. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Erfang Shan, Yanxia Dong, Yukun Cheng |
The twin domination number in generalized de Bruijn digraphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Irene Fink, Sven Oliver Krumke, Stephan Westphal |
New lower bounds for online k-server routing problems. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dariusz R. Kowalski, Michal Strojnowski |
Gossiping by processors prone to omission failures. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Damien Imbs, Michel Raynal |
A note on atomicity: Boosting Test&Set to solve consensus. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jussi Kujala |
Assembling approximately optimal binary search trees efficiently using arithmetics. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kangbok Lee, Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo |
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacob Jan Paulus, Deshi Ye, Guochuan Zhang |
Optimal online-list batch scheduling. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chia-Jui Lai |
A note on path bipancyclicity of hypercubes. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiansheng Cai, Jianfeng Hou, Xia Zhang, Guizhen Liu |
Edge-choosability of planar graphs without non-induced 5-cycles. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Etienne Birmelé, François Delbot, Christian Laforest |
Mean analysis of an online algorithm for the vertex cover problem. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenceslas Fernandez de la Vega, Zsolt Tuza |
Groupies in random graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengbing Bian, Qian-Ping Gu |
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-Luc Baril |
More restrictive Gray codes for some classes of pattern avoiding permutations. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Grassl, Rainer Steinwandt |
Cryptanalysis of an authentication scheme using truncated polynomials. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hai Liu, Lizhuang Ma, Xuan Cai, Zhihua Chen, Yang Shen |
A closed-form solution to video matting of natural snow. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos |
Approximation of min coloring by moderately exponential algorithms. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi |
Strategical languages of infinite words. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tung-Yang Ho, Yuan-Kang Shih, Jimmy J. M. Tan, Lih-Hsing Hsu |
Conditional fault hamiltonian connectivity of the complete graph. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zsolt Gazdag, Szabolcs Iván, Judit Nagy-György |
Improved upper bounds on synchronizing nondeterministic automata. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Balder ten Cate |
A note on the expressibility problem for modal logics and star-free regular expressions. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerhard J. Woeginger |
A comment on parallel-machine scheduling under a grade of service provision to minimize makespan. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Saxena |
Dominance made simple. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski |
Frequency of correctness versus average polynomial time. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bang Ye Wu |
An optimal algorithm for the maximum-density path in a tree. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Okan Yilmaz, Ing-Ray Chen |
Elastic threshold-based admission control for QoS satisfaction with reward optimization for servicing multiple priority classes in wireless networks. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Cheng He, Yixun Lin, Jinjiang Yuan |
A DP algorithm for minimizing makespan and total completion time on a series-batching machine. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohamed Abdo |
Efficient generation of the ideals of a poset in Gray code order. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Qi-yan Zhou, San-Yang Liu, Qiang Zhu |
Local diagnosability of generic star-pyramid graph. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Ariel Yaroshevitch |
Wireless network design via 3-decompositions. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandan Saha, Sandip Das |
Covering a set of points in a plane using two parallel rectangles. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommaso Bolognesi |
A pseudo-random network mobile automaton with linear growth. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hadas Shachnai, Lisa Zhang, Tomomi Matsui |
A note on generalized rank aggregation. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Frati, Markus Geyer, Michael Kaufmann |
Planar packing of trees and spider trees. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elvira Albert, John P. Gallagher, Miguel Gómez-Zamalloa, Germán Puebla |
Type-based homeomorphic embedding for online termination. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Takayuki Nagoya |
New differential approximation algorithm for k-customer vehicle routing problem. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Lukasz Kowalik, Mateusz Wykurz |
Exponential-time approximation of weighted set cover. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Simona E. Rombo |
Optimal extraction of motif patterns in 2D. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Anthony Widjaja To |
Unary finite automata vs. arithmetic progressions. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Mulzer |
A note on predecessor searching in the pointer machine model. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xie-Bin Chen |
Some results on topological properties of folded hypercubes. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Uwe Bubeck, Hans Kleine Büning |
A new 3-CNF transformation by parallel-serial graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Joanna Bauer, Dag Haugland, Di Yuan |
New results on the time complexity and approximation ratio of the Broadcast Incremental Power algorithm. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ippei Koura, Takao Ono, Tomio Hirata |
A note on the Greedy algorithm for finding independent sets of Ck-free graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff |
Sort and Search: Exact algorithms for generalized domination. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Orlov |
Optimized random number generation in an interval. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrzej Lingas, Eva-Marta Lundell |
Efficient approximation algorithms for shortest cycles in undirected graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Cachin, Idit Keidar, Alexander Shraer |
Fork sequential consistency is blocking. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Byungchun Chung, Junbeom Hur, Heeyoul Kim, Seong-Min Hong, Hyunsoo Yoon |
Improved batch exponentiation. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xuan Cai |
Linear kernelizations for restricted 3-Hitting Set problems. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Xindong Zhang, Juan Liu, Jixiang Meng |
The bondage number in complete t-partite digraphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Abellanas, Santiago Canales, Gregorio Hernández-Peñalver |
An "Art Gallery Theorem" for pyramids. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter Rautenbach, Friedrich Regen |
On packing shortest cycles in graphs. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hue-Ling Chen, Ye-In Chang |
Spatial joins based on NA-trees. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Antti Ukkonen, Kai Puolamäki, Aristides Gionis, Heikki Mannila |
A randomized approximation algorithm for computing bucket orders. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sasanka Roy, Subhasis Bhattacharjee, Sandip Das, Subhas C. Nandy |
A new fast heuristic for labeling points. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")