Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
1 | Hugo L. Jonker, Sjouke Mauw, Jun Pang 0001 |
A formal framework for quantifying voter-controlled privacy. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | David Pinto 0001, Jorge Civera, Alberto Barrón-Cedeño, Alfons Juan, Paolo Rosso |
A statistical approach to crosslingual natural language tasks. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Carmen Cortés, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia, Inmaculada Ventura |
Bichromatic separability with two boxes: A general approach. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Claudia Zepeda, José Luis Carballido |
P-stable models of strong kernel programs. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Martijn van Otterlo |
Intensional dynamic programming. A Rosetta stone for structured dynamic programming. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Verena Heidrich-Meisner, Christian Igel |
Neuroevolution strategies for episodic reinforcement learning. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Jan Treur |
Past-future separation and normal forms in temporal predicate logic specifications. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Mauricio Osorio 0001, Iván Olmos |
Preface. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Pierre Flener, Justin Pearson |
Solving necklace constraint problems. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Cláudio Adriano Policastro, Roseli A. F. Romero, Giovana Zuliani, Ednaldo Brigante Pizzolato |
Learning of shared attention in sociable robotics. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Roxana Dánger, Rafael Berlanga Llavori |
Generating complex ontology instances from documents. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Alejandro Guerra-Hernández, José Martín Castro-Manzano, Amal El Fallah Seghrouchni |
CTL AgentSpeak(L): A specification language for agent programs. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Stefania Costantini, Andrea Formisano 0001 |
Modeling preferences and conditional preferences on resource consumption and production in ASP. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Tongquan Zhang, Weidong Li 0002, Jianping Li 0007 |
An improved approximation algorithm for the ATSP with parameterized triangle inequality. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Andriy Burkov, Brahim Chaib-draa |
Effective learning in the presence of adaptive counterparts. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Kostas Stathis, Artur S. d'Avila Garcez, Robert Givan |
Preface: Reinforcement Learning. |
J. Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
1 | Matti Järvisalo, Ilkka Niemelä |
The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Yuriy Brun |
Solving satisfiability in the tile assembly model with a constant-size tileset. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Meritxell Vinyals, Andrea Giovannucci, Jesús Cerquides, Pedro Meseguer, Juan A. Rodríguez-Aguilar |
A test suite for the evaluation of mixed multi-unit combinatorial auctions. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Jon Williamson |
Objective Bayesian probabilistic logic. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Luca Di Gaspero, Andrea Roli |
Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Richard J. Wallace, Diarmuid Grimes |
Experimental studies of variable selection strategies based on constraint weights. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | João Marques-Silva 0001 |
Model checking with Boolean Satisfiability. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Gilles Audemard, Saïd Jabbour, Lakhdar Sais |
SAT graph-based representation: A new perspective. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Francesco Calimeri, Simona Perri, Francesco Ricca |
Experimenting with parallelism for the instantiation of ASP programs. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Marco Gavanelli, Toni Mancini |
RCRA 2007: Experimental evaluation of algorithms for solving problems with combinatorial explosion. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Marco Maratea, Francesco Ricca, Wolfgang Faber 0001, Nicola Leone |
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers. |
J. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
1 | Sergio Cabello |
Approximation algorithms for spreading points. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Cláudia Nalon, Clare Dixon |
Clausal resolution for normal modal logics. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Benjamín René Callejas Bedregal |
A normal form which preserves tautologies and contradictions in a class of fuzzy logics. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Surender Baswana, Ramesh Hariharan, Sandeep Sen |
Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Christiano Braga |
Special issue: LSFA'06. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Amin Coja-Oghlan |
Solving NP-hard semirandom graph problems in polynomial expected time. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Narciso Martí-Oliet, Miguel Palomino, Alberto Verdejo |
Strategies and simulations in a semantic framework. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Tomás Feder, Rajeev Motwani 0001, Liadan O'Callaghan, Chris Olston, Rina Panigrahy |
Computing shortest paths with uncertainty. |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Robson da Luz, Mirian Halfeld Ferrari Alves, Martin A. Musicante |
Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator). |
J. Algorithms |
2007 |
DBLP DOI BibTeX RDF |
|
1 | Arye Barkan, Haim Kaplan |
Partial alphabetic trees. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Petr Kolman, Christian Scheideler |
Improved bounds for the unsplittable flow problem. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Bruce E. Sagan, Jaejin Lee |
An algorithmic sign-reversing involution for special rim-hook tableaux. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Anne Berry, Jean Paul Bordat, Pinar Heggernes, Geneviève Simonet, Yngve Villanger |
A wide-range algorithm for minimal triangulation from an arbitrary ordering. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Uriel Feige, Michael Langberg |
The RPR2 rounding technique for semidefinite programs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Edith Cohen, Martin J. Strauss |
Maintaining time-decaying stream aggregates. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Simon R. Blackburn, Domingo Gómez-Pérez, Jaime Gutierrez 0001, Igor E. Shparlinski |
Reconstructing noisy polynomial evaluation in residue rings. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Ian F. Blake, V. Kumar Murty, Guangwu Xu |
Refinements of Miller's algorithm for computing the Weil/Tate pairing. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Samir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan |
On generalized gossiping and broadcasting. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Srinivas R. Kashyap, Samir Khuller |
Algorithms for non-uniform size data placement on parallel disks. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Nicholas J. A. Harvey, Richard E. Ladner, László Lovász 0001, Tami Tamir |
Semi-matchings for bipartite graphs and load balancing. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Victor Chepoi, Feodor F. Dragan, Yann Vaxès |
Distance and routing labeling schemes for non-positively curved plane graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Jop F. Sibeyn |
External selection. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Igor E. Zverovich |
A new kind of graph coloring. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhoff |
A heuristic for the Stacker Crane Problem on trees which is almost surely exact. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk |
Space efficient algorithms for directed series-parallel graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Alexander Kesselman, Adi Rosén |
Scheduling policies for CIOQ switches. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Zhi-Zhong Chen, Tatsuie Tsukiji |
Computing bounded-degree phylogenetic roots of disconnected graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Aranyak Mehta, Scott Shenker, Vijay V. Vazirani |
Posted price profit maximization for multicast by approximating fixed points. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Ilya Safro, Dorit Ron, Achi Brandt |
Graph minimum linear arrangement by multilevel weighted edge contractions. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Zheng Sun, John H. Reif |
On finding approximate optimal paths in weighted regions. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Esther M. Arkin, Refael Hassin, Asaf Levin |
Approximations for minimum and min-max vehicle routing problems. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Gagan Aggarwal, Rajeev Motwani 0001, An Zhu |
The load rebalancing problem. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Biing-Feng Wang, Shietung Peng, Hong-Yi Yu, Shan-Chyun Ku |
Efficient algorithms for a constrained k-tree core problem in a tree network. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Artur Czumaj, Wojciech Rytter |
Broadcasting algorithms in radio networks with unknown topology. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Monaldo Mastrolilli |
A linear time approximation scheme for the single machine scheduling problem with controllable processing times. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Guillermo Durán, Agustín Gravano, Ross M. McConnell, Jeremy P. Spinrad, Alan Tucker |
Polynomial time recognition of unit circular-arc graphs. |
J. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
1 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
Cutwidth I: A linear time fixed parameter algorithm. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Richard Beigel, David Eppstein |
3-coloring in time O(1.3289n). |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Micah Adler, Adi Rosén |
Tight bounds for the performance of Longest In System on DAGs. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Kenneth Weber, Vilmar Trevisan, Luiz Felipe Martins |
A modular integer GCD algorithm. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Moni Naor |
On fairness in the carpool problem. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Robin Pemantle |
Cycles in random k-ary maps and the poor performance of random number generation. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | René Sitters |
Complexity of preemptive minsum scheduling on unrelated parallel machines. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Graham Cormode, S. Muthukrishnan 0001 |
An improved data stream summary: the count-min sketch and its applications. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Tor Schoenmeyr, David Yu Zhang |
FFT-based algorithms for the string matching with mismatches problem. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Oliver Schirokauer |
Virtual logarithms. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Michael A. Bender, Martin Farach-Colton, Giridhar Pemmasani, Steven Skiena, Pavel Sumazin |
Lowest common ancestors in trees and directed acyclic graphs. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Daniel J. Bernstein |
Factoring into coprimes in essentially linear time. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Reuven Bar-Yehuda, Guy Even, Shimon Shahar |
On approximating a geometric prize-collecting traveling salesman problem with time windows. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Veli Mäkinen, Gonzalo Navarro 0001, Esko Ukkonen |
Transposition invariant string matching. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Arie Tamir, Justo Puerto, Juan A. Mesa, Antonio M. Rodríguez-Chía |
Conditional location of path and tree shaped facilities on trees. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Christine E. Heitsch |
Insufficiency of four known necessary conditions on string unavoidability. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | William Aiello, Yishay Mansour, S. Rajagopolan, Adi Rosén |
Competitive queue policies for differentiated services. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Biing-Feng Wang |
Linear time algorithms for the ring loading problem with demand splitting. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Robin Pemantle |
A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho |
Efficient parallel exponentiation in GF(qn) using normal basis representations. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Dean Hoffman, Peter D. Johnson Jr., Nadine Wilson |
Generating Huffman sequences. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Hiroshi Nagamochi |
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Mark de Berg, Joachim Gudmundsson, Matthew J. Katz, Christos Levcopoulos, Mark H. Overmars, A. Frank van der Stappen |
TSP with neighborhoods of varying size. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Rob van Stee, Johannes A. La Poutré |
Minimizing the total completion time on-line on a single machine, using restarts. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Rainer Schuler |
An algorithm for the satisfiability problem of formulas in conjunctive normal form. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Alberto Del Lungo, Guy Louchard, Claudio Marini, Franco Montagna |
The Guessing Secrets problem: a probabilistic approach. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Martin Kochol |
3-coloring and 3-clique-ordering of locally connected graphs: . |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Feodor F. Dragan |
Estimating all pairs shortest paths in restricted graph families: a unified approach. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Yair Bartal, Manor Mendel |
Randomized k-server algorithms for growth-rate bounded graphs. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
Cutwidth II: Algorithms for partial w-trees of bounded degree. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ben Gum, Richard J. Lipton, Andrea S. LaPaugh, Faith E. Fich |
Estimating the maximum. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | James Aspnes, Orli Waarts |
Compositional competitiveness for distributed algorithms. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Benoît Larose, Cynthia Loten, László Zádori |
A polynomial-time algorithm for near-unanimity graphs. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | S. Muthukrishnan 0001, Torsten Suel |
Approximation algorithms for array partitioning problems. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Michael Filaseta, Douglas B. Meade |
Irreducibility testing of lacunary 0, 1-polynomials. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Ashish Goel, Monika Rauch Henzinger, Serge A. Plotkin |
An online throughput-competitive algorithm for multicast routing and admission control. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
1 | Yoo Ah Kim |
Data migration to minimize the total completion time. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|