| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Charles Reams |
Anatree: A Fast Data Structure for Anagrams.  |
ACM Journal of Experimental Algorithmics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kröller, Tobias Baumgartner, Sándor P. Fekete, Christiane Schmidt |
Exact solutions and bounds for general art gallery problems. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | John M. Ennis, Charles M. Fayle, Daniel M. Ennis |
Assignment-minimum clique coverings. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew Dellinger, Aaron Lindsay, Binoy Ravindran |
An experimental evaluation of the scalability of real-time scheduling algorithms on large-scale multicore platforms. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Geisberger, Michael N. Rice, Peter Sanders, Vassilis J. Tsotras |
Route planning with flexible edge restrictions. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Eduardo Uchoa, Renato Fonseca F. Werneck |
Fast local search for the steiner problem in graphs. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Bachmaier, Wolfgang Brunner, Andreas Gleißner |
Grid sifting: Leveling and crossing reduction. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tolu Alabi, Jeffrey D. Blanchard, Bradley Gordon, Russel Steinbach |
Fast k-selection algorithms for graphics processing units. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy E. Blelloch, Dan Halperin |
Introduction to special issue ALENEX'10. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Sanders, Dominik Schultes |
Engineering highway hierarchies. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcel R. Ackermann, Marcus Märtens, Christoph Raupach, Kamil Swierkot, Christiane Lammersen, Christian Sohler |
StreamKM++: A clustering algorithm for data streams. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias F. Stallmann |
A heuristic for bottleneck crossing minimization and its performance on general crossing minimization: Hypothesis and experimental study. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Delling, Bastian Katz, Thomas Pajor |
Parallel computation of best connections in public transportation networks. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Jyothish Soman, Kishore Kothapalli, P. J. Narayanan |
Discrete range searching primitive for the GPU and its applications. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | David A. Bader, Philippas Tsigas |
ACM journal on experimental algorithmics special issue on multicore algorithms. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai Christian Bader, Mikhail J. Atallah, Christian Grothoff |
Efficient relaxed search in hierarchically clustered sequence datasets. |
ACM Journal of Experimental Algorithmics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Bei Wang, Herbert Edelsbrunner, Dmitriy Morozov |
Computing elevation maxima by searching the gauss sphere. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Bertasi, Marco Bressan 0002, Enoch Peserico |
psort, yet another fast stable sorting software. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Siamak Tazari, Matthias Müller-Hannemann |
Dealing with large hidden constants: engineering a planar steiner tree PTAS. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Charalampos E. Tsourakakis, Richard Peng, Maria A. Tsiarli, Gary L. Miller, Russell Schwartz |
Approximation algorithms for speeding up dynamic programming and denoising aCGH data. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Müller-Hannemann, Renato Fonseca F. Werneck |
Introduction to special issue ALENEX'11. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andriy Kot, Andrey N. Chernikov, Nikos Chrisochoides |
Effective out-of-core parallel delaunay mesh refinement using off-the-shelf software. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Huber, Martin Held |
Motorcycle graphs: Stochastic properties motivate an efficient yet simple implementation. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Irene Finocchi, John Hershberger |
Guest editors' foreword. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Lionel Tabourier, Camille Roth, Jean-Philippe Cointet |
Generating constrained random graphs using multiple edge switches. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Sebastiano Vigna |
Theory and practice of monotone minimal perfect hashing. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Philipp Hungerländer, Michael Jünger, Petra Mutzel |
An SDP approach to multi-level crossing minimization. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald |
Quasirandom rumor spreading: An experimental analysis. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cosmin Silvestru Negruseri, Mircea Bogdan Pacsosi, Barbara Stanley, Clifford Stein, Cristian George Strat |
Solving maximum flow problems on real-world bipartite graphs. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Vahrenhold |
Preface. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Isabelle Stanton, Ali Pinar |
Constructing and sampling graphs with a prescribed joint degree distribution. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitrios Michail 0001 |
An experimental comparison of single-sided preference matching algorithms. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Patrick Prosser, Chris Unsworth |
Limited discrepancy search revisited. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepak Ajwani, Adan Cosgaya-Lozano, Norbert Zeh |
A topological sorting algorithm for large graphs. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iulian Moraru, David G. Andersen |
Exact pattern matching with feed-forward bloom filters. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Randolf Rotta, Andreas Noack |
Multilevel local search algorithms for modularity clustering. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Herman J. Haverkort, Freek van Walderveen |
Four-dimensional hilbert curves for R-trees. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter Biró, Robert W. Irving, Ildikó Schlotter |
Stable matching with couples: An empirical study. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonid Boytsov |
Indexing methods for approximate dictionary searching: Comparative analysis. |
ACM Journal of Experimental Algorithmics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicholas Nash, David Gregg |
Comparing integer data structures for 32- and 64-bit keys. |
ACM Journal of Experimental Algorithmics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Langguth, Fredrik Manne, Peter Sanders |
Heuristic initialization for bipartite matching problems. |
ACM Journal of Experimental Algorithmics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Bauer, Daniel Delling, Peter Sanders, Dennis Schieferdecker, Dominik Schultes, Dorothea Wagner |
Combining hierarchical and goal-directed speed-up techniques for dijkstra's algorithm. |
ACM Journal of Experimental Algorithmics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Carsten Gutwenger, Petra Mutzel, Hoi-Ming Wong |
Layer-free upward crossing minimization. |
ACM Journal of Experimental Algorithmics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ivor Spence |
sgen1: A generator of small but difficult satisfiability benchmarks. |
ACM Journal of Experimental Algorithmics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Catherine C. McGeoch |
Preface. |
ACM Journal of Experimental Algorithmics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Jacobs |
An experimental study of recent hotlink assignment algorithms. |
ACM Journal of Experimental Algorithmics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ranjan Sinha, Anthony Wirth |
Engineering burstsort: Toward fast in-place string sorting. |
ACM Journal of Experimental Algorithmics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesús A. De Loera, David C. Haws, Jon Lee, Allison O'Hair |
Computation in multicriteria matroid optimization. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir G. Deineko, Alexander Tiskin |
Fast minimum-weight double-tree shortcutting for metric TSP: Is the best one good enough? |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria J. Serna, Carme Àlvarez |
Preface to special section of selected papers from WEA 2006. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Farshi, Joachim Gudmundsson |
Experimental study of geometric t-spanners. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Camil Demetrescu |
Preface. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera |
Reduction rules deliver efficient FPT-algorithms for covering points with lines. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Friedrich Eisenbrand, Andreas Karrenbauer, Chihao Xu |
Algorithms for longer OLED lifetime. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Leonor Frias, Jordi Petit, Salvador Roura |
Lists revisited: Cache-conscious STL lists. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alaubek Avdil, Karsten Weihe |
Local search starting from an LP solution: Fast and quite good. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Bauer, Daniel Delling |
SHARC: Fast and robust unidirectional routing. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Dumitriu, Stefan Funke, Martin Kutz, Nikola Milosavljevic |
How much geometry it takes to reconstruct a 2-manifold in R3. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Carsten Gutwenger, Petra Mutzel |
Experiments on exact crossing minimization using column generation. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Endre Tarjan, Renato Fonseca F. Werneck |
Dynamic trees in practice. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tom Coleman, Anthony Wirth |
Ranking tournaments: Local search and a new algorithm. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Ian Munro, Dorothea Wagner |
Preface. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert W. Irving, David Manlove |
Finding large stable matchings. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémy Barbay, Alejandro López-Ortiz, Tyler Lu, Alejandro Salinger |
An experimental investigation of set intersection algorithms for text searching. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Niko Välimäki, Veli Mäkinen, Wolfgang Gerlach, Kashyap Dixit |
Engineering a compressed suffix tree implementation. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Putze, Peter Sanders, Johannes Singler |
Cache-, hash-, and space-efficient bloom filters. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Cederman, Philippas Tsigas |
GPU-Quicksort: A practical Quicksort algorithm for graphics processors. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryant A. Julstrom |
Greedy heuristics for the bounded diameter minimum spanning tree problem. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthias Englert, Heiko Röglin, Matthias Westermann |
Evaluation of online strategies for reordering buffers. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra Mutzel |
Obtaining optimal k-cardinality trees fast. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Karina Figueroa, Edgar Chávez, Gonzalo Navarro, Rodrigo Paredes |
Speeding up spatial approximation search in metric spaces. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Maue, Peter Sanders, Domagoj Matijevic |
Goal-directed shortest-path queries using precomputed cluster distances. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris V. Cherkassky, Loukas Georgiadis, Andrew V. Goldberg, Robert Endre Tarjan, Renato Fonseca F. Werneck |
Shortest-path feasibility algorithms: An experimental evaluation. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amitabh Basu, Joseph S. B. Mitchell, Girishkumar Sabhnani |
Geometric algorithms for optimal airspace design and air traffic controller workload balancing. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Holzer, Frank Schulz, Dorothea Wagner, Grigorios Prasinos, Christos D. Zaroliagis |
Engineering planar separator algorithms. |
ACM Journal of Experimental Algorithmics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Raman, Matthias F. Stallmann |
Preface. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Clémence Magnien, Matthieu Latapy, Michel Habib |
Fast computation of empirically tight bounds for the diameter of massive graphs. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Diameter bounds, graph diameter |
| 1 | Amr Elmasry, Abdelrahman Hammad |
Inversion-sensitive sorting algorithms in practice. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Adaptive sorting, Inversions |
| 1 | Paul Biggar, Nicholas Nash, Kevin Williams, David Gregg |
An experimental study of sorting and branch prediction. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
caching, Sorting, branch prediction, pipeline architectures |
| 1 | Amotz Bar-Noy, Richard E. Ladner, Jacob Christensen, Tami Tamir |
A general buffer scheme for the windows scheduling problem. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Periodic scheduling, media-on-demand |
| 1 | Ioannis Krommidas, Christos D. Zaroliagis |
An experimental study of algorithms for fully dynamic transitive closure. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
reachability, Transitive closure, dynamic algorithm, path |
| 1 | Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders |
Better external memory suffix array construction. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
algorithms for strings, suffix array, external memory, large data sets, Algorithm engineering, I/O-efficient, secondary memory |
| 1 | Ilya Safro, Dorit Ron, Achi Brandt |
Multilevel algorithms for linear ordering problems. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Multilevel algorithm, algebraic multigrid, linear ordering |
| 1 | Kimmo Fredriksson |
Succinct backward-DAWG-matching. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
multiple string matching, compression, String matching, text indexing |
| 1 | Idit Haran, Dan Halperin |
An experimental study of point location in planar arrangements in CGAL. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
computational geometry, generic programming, arrangements, Point location, CGAL |
| 1 | Andreas Larsson, Anders Gidenstam, Phuong Hoai Ha, Marina Papatriantafilou, Philippas Tsigas |
Multiword atomic read/write registers on multiprocessor systems. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
synchronization, wait-free, Atomic register |
| 1 | Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton |
A graph approach to the threshold all-against-all substring matching problem. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
complexity, bioinformatics, String matching |
| 1 | Nicholas Nash, Sylvain Lelait, David Gregg |
Efficiently implementing maximum independent set algorithms on circle graphs. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Circle graph, maximum stable set, maximum independent set |
| 1 | Georg Gottlob, Marko Samer |
A backtracking-based algorithm for hypertree decomposition. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
hypertree decomposition, Constraint satisfaction |
| 1 | Keqin Li |
Experimental average-case performance evaluation of online algorithms for routing and wavelength assignment and throughput maximization in WDM optical networks. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Average-case performance, routing, online algorithm, optical network, wavelength division multiplexing, competitive ratio, wavelength assignment |
| 1 | Gonzalo Navarro |
Implementing the LZ-index: Theory versus practice. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
coding and information theory, Data structures, indexing methods, textual databases, data storage representations |
| 1 | Thomas Hazel, Laura Toma, Jan Vahrenhold, Rajiv Wickremesinghe |
Terracost: Computing least-cost-path surfaces for massive grid terrains. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
terrain data, shortest paths, Dijkstra's algorithm, I/O-efficiency, Data structures and algorithms |
| 1 | Martin Dietzfelbinger, Martin Hühne, Christoph Weidling |
A dictionary implementation based on dynamic perfect hashing. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
dynamic hashing, Data structures, implementation, hash functions, dictionaries |
| 1 | Telikepalli Kavitha, Katakam Vamsi Krishna |
An improved heuristic for computing short integral cycle bases. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
integral cycle basis, minimum cycle basis, combinatorial optimization, Directed graph |
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz |
On the adaptiveness of Quicksort. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Adaptive sorting, Quicksort, branch mispredictions |
| 1 | John D. Crabtree, Dinesh P. Mehta |
Automated reaction mapping. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Cheminformatics, mechanisms |
| 1 | Wady Naanaa |
A domain decomposition algorithm for constraint satisfaction. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Constraint graph orientation, domain decomposition algorithms, value substitutability, constraint satisfaction problems |
| 1 | Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret |
Approximating the true evolutionary distance between two genomes. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
pairwise distances, whole-genome data, Evolution, inversions, duplications |
| 1 | John Hershberger, Nisheeth Shrivastava, Subhash Suri |
Summarizing spatial data streams using ClusterHulls. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
geometric data, data streams, Convex hull |
| 1 | Bruno Codenotti, Benton McCune, Sriram V. Pemmaraju, Rajiv Raman, Kasturi R. Varadarajan |
An experimental study of different approaches to solve the market equilibrium problem. |
ACM Journal of Experimental Algorithmics |
2008 |
DBLP DOI BibTeX RDF |
Market equilibrium |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")