| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Wenjie Li, Zhenkun Zhang, Hailing Liu, Jinjiang Yuan |
Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | James Aspnes, Yitong Yin |
Randomized load balancing by joining and splitting bins.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaofan Yang, Lei Wang, Luxing Yang |
Optimal broadcasting for locally twisted cubes.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Turetsky |
A K-trivial set which is not jump traceable at certain orders.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart Mennink |
Increasing the flexibility of the herding attack.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Sergey, Dave Clarke |
A correspondence between type checking via reduction and type checking via evaluation.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fang Tian, Zi-Long Liu |
Probabilistic single obnoxious facility location with fixed budget.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Refael Hassin |
Series-parallel orientations preserving the cycle-radius.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Reiko Takehara, Masahiro Hachimori, Maiko Shigeno |
A comment on pure-strategy Nash equilibria in competitive diffusion games.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Chakrabarti |
A note on randomized streaming space bounds for the longest increasing subsequence problem.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qingju Wang, Andrey Bogdanov |
The provable constructive effect of diffusion switching mechanism in CLEFIA-type block ciphers.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Janusz Dybizbanski, Anna Nenca |
Oriented chromatic number of grids is greater than 7.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner |
A note on a single machine scheduling problem with generalized total tardiness objective function.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zongyang Zhang, Zhenfu Cao |
Concurrent non-malleable statistically hiding commitment.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam O. Kalinich |
Flipping the winner of a poset game.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shayan Ehsani, Mohammad Ghodsi, Ahmad Khajenezhad, Hamid Mahini, Afshin Nikzad |
Optimal online pricing with network externalities.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Florian Sikora |
On the parameterized complexity of the repetition free longest common subsequence problem.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Kotrbcík |
A note on disjoint cycles.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maxim Sviridenko |
A note on the Kenyon-Remila strip-packing algorithm.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheng Yu, Prudence W. H. Wong |
A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time".  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jinsoo Hwang, Jeankyung Kim, Kichang Kim |
Analysis of the false-positive error rate of tagged fragment marking scheme.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey Bereg |
Computing generalized ham-sandwich cuts.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Effat Farhana, M. Sohel Rahman |
Doubly-Constrained LCS and Hybrid-Constrained LCS problems revisited.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Or Meir |
On the rectangle method in proofs of robustness of tensor products.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mereke van Garderen, Giuseppe Liotta, Henk Meijer |
Universal point sets for 2-coloured trees.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chen Su, Haining Fan |
Impact of Intel's new instruction sets on software implementation of GF(2)[x] multiplication.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Indra Rajasingh, Bharati Rajan, R. Sundara Rajan |
Embedding of hypercubes into necklace, windmill and snake graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Joanna Skowronek-Kaziów |
Multiplicative vertex-colouring weightings of graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes |
On the nonnegative rank of distance matrices.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xin Zhang, Guizhen Liu |
On edge colorings of 1-planar graphs without adjacent triangles.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Reza Dorrigiv, Alejandro López-Ortiz |
List update with probabilistic locality of reference.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xie-Bin Chen |
Paired many-to-many disjoint path covers of hypercubes with faulty edges.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yu Li, Dachuan Xu, Donglei Du, Naihua Xiu |
Improved approximation algorithms for the robust fault-tolerant facility location problem.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Houston, Joseph White, Martyn Amos |
Zen Puzzle Garden is NP-complete.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Clemens Dubslaff, Christel Baier, Manuela Berg |
Model checking probabilistic systems against pushdown specifications.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stanley P. Y. Fung, Chung Keung Poon, Duncan K. W. Yung |
On-line scheduling of equal-length intervals on parallel machines.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Joseph Wun-Tat Chan, Xin Han, Ka-Cheong Lam |
Online call control in cellular networks revisited.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaoni Du, Andrew Klapper, Zhixiong Chen |
Linear complexity of pseudorandom sequences generated by Fermat quotients and their generalizations.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir V. Podolskii |
Exponential lower bound for bounded depth circuits with few threshold gates.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Beibei Ma, Baoyindureng Wu, Wanping Zhang |
Proximity and average eccentricity of a graph.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Kutzkov |
An exact exponential time algorithm for counting bipartite cliques.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiang Cheng, Feng Chen, Wenli Xu, Song Wang |
Recursive sum-product algorithm for generalized outer-planar graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiying Wang, Lei Zhang, Shangwei Lin |
A neighborhood condition for graphs to be maximally k-restricted edge connected.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Dieter Kratsch |
Bicolored independent sets and bicliques.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yun-Ping Deng, Xiao-Dong Zhang |
Automorphism groups of the Pancake graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Thomas |
On the applicability of Post's lattice.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Norichika Matsuki |
An analytic criterion for CSAT.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Abuzer Yakaryilmaz |
Superiority of exact quantum automata for promise problems.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David Clark, Robert M. Hierons |
Squeeziness: An information theoretic measure for avoiding fault masking.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mieczyslaw Borowiecki, Jaroslaw Grytczuk, Monika Pilsniak |
Coloring chip configurations on graphs and digraphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabiano C. Botelho, Nicholas C. Wormald, Nivio Ziviani |
Cores of random r-partite hypergraphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sebastian Deorowicz |
Quadratic-time algorithm for a string constrained LCS problem.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Vassilis Giakoumakis |
Maximum Weight Independent Sets in hole- and co-chair-free graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Golynski, Alejandro López-Ortiz |
Optimal strategies for the list update problem under the MRM alternative cost model.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | László Csirmaz |
Complexity of universal access structures.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashley Montanaro |
The quantum query complexity of learning multilinear polynomials.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jian Wang, Xirong Xu, Dejun Zhu, Liqing Gao, Jun-Ming Xu |
On the bounds of feedback numbers of (n, k)-star graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Kochol, Riste Skrekovski |
Brooksʼ Theorem for generalized dart graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Cui Yu, Xiaofan Yang, Luxing Yang, Jing Zhang |
Routing and wavelength assignment for 3-ary n-cube in array-based optical network.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Crowston, Gregory Gutin, M. Jones, A. Yeo |
Parameterized Eulerian strong component arc deletion problem on tournaments.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Shay Gueron |
Speeding up CRC32C computations with Intel CRC32 instruction.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiyou Li |
On the average sensitivity of the weighted sum function.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Jörg Rothe |
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mingyu Xiao, Hiroshi Nagamochi |
An FPT algorithm for edge subset feedback edge set.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Singleton and 2-periodic attractors of sign-definite Boolean networks.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Feng Wang, Wensong Lin |
Group path covering and L(j, k)-labelings of diameter two graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Liting Zhang, Wenling Wu, Peng Wang, Bo Liang |
TrCBC: Another look at CBC-MAC.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tibor Jordán |
Highly connected molecular graphs are rigid in three dimensions.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhengnan Shi |
A self-stabilizing algorithm to maximal 2-packing with improved complexity.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gaocai Wang, Guojun Wang, Zhiguang Shan |
Fault tolerance analysis of mesh networks with uniform versus nonuniform node failure probability.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Ahadi, A. Dehghan, M. Kazemi, E. Mollaahmadi |
Computation of lucky number of planar graphs is NP-hard.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rasmus Pagh, Charalampos E. Tsourakakis |
Colorful triangle counting and a MapReduce implementation.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert E. Jamison, Darren A. Narayan |
Max-optimal and sum-optimal labelings of graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Schmidt-Schauß, Georg Schnitger |
Fast equality test for straight-line compressed strings.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Iksoon Hwang, Nina Yevtushenko, Ana R. Cavalli |
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Deke Guo, Guiming Zhu, Hai Jin, Panlong Yang, Yingwen Chen, Xianqing Yi, Junxian Liu |
Möbius-deBruijn: The product of Möbius cube and deBruijn digraph.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lukas Moll, Siamak Tazari, Marc Thurley |
Computing hypergraph width measures exactly.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Krajícek |
A note on SAT algorithms and proof complexity.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenhua Li, Zhenkun Zhang, Sufang Yang |
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Xiaomin Zhu, Hao Guo, Shaoshuai Liang, Xiaoling Yang |
An improved security-aware packet scheduling algorithm in real-time wireless networks.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sonia L. Rueda, Juana Sendra |
On the performance of the approximate parametrization algorithm for curves.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Phokion G. Kolaitis, Enela Pema |
A dichotomy in the complexity of consistent query answering for queries with two atoms.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bogdan Aman, Gabriel Ciobanu |
Properties of enhanced mobile membranes via coloured Petri nets.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig |
Drawing trees in a streaming model.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chen Yuan, Qian Guo, Haibin Kan |
A novel elementary construction of matching vectors.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Leena Salmela |
Average complexity of backward q-gram string matching algorithms.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Edward A. Hirsch, Dmitry Itsykson |
On an optimal randomized acceptor for graph nonisomorphism.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amr Elmasry |
On the size of the subset partial order.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Qiping Lin, Fangguo Zhang |
Efficient precomputation schemes of kP+IQ.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Chia-Jung Chang, Kun-Mao Chao |
Efficient algorithms for local ranking.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo C. Xavier |
A note on a Maximum k-Subset Intersection problem.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Amit Weinstein |
Local correction of juntas.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Anish Man Singh Shrestha, Satoshi Tayu, Shuichi Ueno |
Bandwidth of convex bipartite graphs and related graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing He, Hongyu Liang |
On rainbow-k-connectivity of random graphs.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Wen-Hung Kuo, Dar-Li Yang |
A short note on "Proportionate flowshops with general position-dependent processing times".  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernardo M. Ábrego, Mario Cetina, Jesús Leaños, Gelasio Salazar |
Visibility-preserving convexifications using single-vertex moves.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Bárány, Mikolaj Bojanczyk |
Finite satisfiability for guarded fixpoint logic.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Carola Winzen |
Memory-restricted black-box complexity of OneMax.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Oliver Krumke, Clemens Thielen |
Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537].  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoann Dieudonné, Andrzej Pelc |
Deterministic network exploration by a single agent with Byzantine tokens.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|