The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "J. Algorithms"( http://dblp.L3S.de/Venues/J._Algorithms )

URL (DBLP): http://dblp.uni-trier.de/db/journals/jal

Publication years (Num. hits)
1980 (21) 1981 (36) 1982 (31) 1983 (33) 1984 (40) 1985 (41) 1986 (38) 1987 (38) 1988 (38) 1989 (33) 1990 (30) 1991 (38) 1992 (38) 1993 (49) 1994 (42) 1995 (46) 1996 (57) 1997 (76) 1998 (65) 1999 (60) 2000 (67) 2001 (60) 2002 (57) 2003 (53) 2004 (45) 2005 (40) 2006 (27) 2007-2008 (20) 2009 (16)
Publication types (Num. hits)
article(1235)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

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