| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao |
On Space Efficient Two Dimensional Range Minimum Data Structures.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao |
External Memory Planar Point Location with Logarithmic Updates. |
Algorithmica |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Alexis C. Kaporis, Apostolos N. Papadopoulos, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas |
Dynamic 3-sided Planar Range Queries with Expected Doubly Logarithmic Time |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Konstantinos Tsakalidis, Spyros Sioutas, Kostas Tsichlas |
Fully persistent B-trees. |
SODA |
2012 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Casper Kejlberg-Rasmussen |
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, George Lagogiannis, Robert Endre Tarjan |
Strict fibonacci heaps. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Beat Gfeller, Allan Grønlund Jørgensen, Peter Sanders |
Towards optimal range medians. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz |
The Cost of Cache-Oblivious Searching. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Casper Kejlberg-Rasmussen |
Cache-Oblivious Implicit Predecessor Dictionaries with the Working Set Property |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin Kutz, Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel |
Faster algorithms for computing longest common increasing subsequences. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Peyman Afshani, Gerth Stølting Brodal, Norbert Zeh |
Ordered and Unordered Top-K Range Reporting in Large Data Sets. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Konstantinos Tsakalidis |
Dynamic Planar Range Maxima Queries. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Mark Greve, Vineet Pandey, Srinivasa Rao Satti |
Integer Representations towards Efficient Counting in the Bit Probe Model. |
TAMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao |
Path Minima Queries in Dynamic Weighted Trees. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Gabriel Moruz, Andrei Negoescu |
OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis |
D2-Tree: A New Overlay with Deterministic Bounds |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari |
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Pooya Davoodi, S. Srinivasa Rao |
On Space Efficient Two Dimensional Range Minimum Data Structures. |
ESA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro |
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Spyros Sioutas, Kostas Tsichlas, Christos D. Zaroliagis |
D2-Tree: A New Overlay with Deterministic Bounds. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Casper Kejlberg-Rasmussen, Jakob Truelsen |
A Cache-Oblivious Implicit Dictionary with the Working Set Property. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Allan Grønlund Jørgensen, Thomas Mølhave |
Fault Tolerant External Memory Algorithms. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Mark Greve, Alejandro López-Ortiz |
Online Sorted Range Reporting. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave |
Counting in the Presence of Memory Faults. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Alexis C. Kaporis, Spyros Sioutas, Konstantinos Tsakalidis, Kostas Tsichlas |
Dynamic 3-Sided Planar Range Queries with Expected Doubly Logarithmic Time. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Allan Grønlund Jørgensen |
Data Structures for Range Median Queries. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Loukas Georgiadis, Irit Katriel |
An O(nlogn) version of the Averbakh-Berman algorithm for the robust median of a tree. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg |
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. |
J. Bioinformatics and Computational Biology |
2008 |
DBLP DOI BibTeX RDF |
|
| 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 | Gerth Stølting Brodal |
Cache-Oblivious Sorting. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, S. Srinivasa Rao |
External memory planar point location with logarithmic updates. |
Symposium on Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
dynamic data structure, external memory, point location, planar subdivisions |
| 1 | Gerth Stølting Brodal, Allan Grønlund Jørgensen |
Selecting Sums in Arrays. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther |
Engineering a cache-oblivious sorting algorithm. |
ACM Journal of Experimental Algorithmics |
2007 |
DBLP DOI BibTeX RDF |
funnelsort, quicksort, Cache-oblivious algorithms |
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano, Allan Grønlund Jørgensen, Gabriel Moruz, Thomas Mølhave |
Optimal Resilient Dynamic Dictionaries. |
ESA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Westergaard, Lars Michael Kristensen, Gerth Stølting Brodal, Lars Arge |
The ComBack Method - Extending Hash Compaction with Backtracking. |
ICATPN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel |
Dynamic Matchings in Convex Bipartite Graphs. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Allan Grønlund Jørgensen |
A Linear Time Algorithm for the k Maximal Sums Problem. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Stig Stissing, Thomas Mailund, Christian N. S. Pedersen, Gerth Stølting Brodal, Rolf Fagerberg |
Computing the All-Pairs Quartet Distance on a Set of Evolutionary Trees. |
APBC |
2007 |
DBLP BibTeX RDF |
|
| 1 | Martin Stig Stissing, Christian N. S. Pedersen, Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg |
Computing the Quartet Distance Between Evolutionary Trees of Bounded Degree. |
APBC |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob, Elias Vicari |
Optimal sparse matrix dense vector multiplication in the I/O-model. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
I/O-model, sparse matrix dense vector multiplication, lower bound, external memory algorithms |
| 1 | Thomas Mailund, Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Derek Phillips |
Recrafting the neighbor-joining method. |
BMC Bioinformatics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Christos Makris, Kostas Tsichlas |
Purely Functional Worst Case Constant Time Catenable Sorted Lists. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
sorted lists, purely functional programming, data structures |
| 1 | Gerth Stølting Brodal, Gabriel Moruz |
Skewed Binary Search Trees. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg |
Cache-oblivious string dictionaries. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz |
Faster Algorithms for Computing Longest Common Increasing Subsequences. |
CPM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, Loukas Georgiadis |
Improved Dynamic Planar Point Location. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Erik D. Demaine, J. Ian Munro |
Fast allocation and deallocation with an improved buddy system. |
Acta Inf. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Stefano Leonardi (eds.) |
Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings |
ESA |
2005 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz |
Cache-Aware and Cache-Oblivious Adaptive Sorting. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz |
On the Adaptiveness of Quicksort. |
ALENEX/ANALCO |
2005 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, Rolf Fagerberg, Morten Laustsen |
Cache-oblivious planar orthogonal range searching and counting. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
range counting, semi-group range queries, cache-oblivious, orthogonal range searching |
| 1 | Gerth Stølting Brodal, Gabriel Moruz |
Tradeoffs Between Branch Mispredictions and Comparisons for Sorting Algorithms. |
WADS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Riko Jacob |
Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries. |
Electr. Notes Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, Laura Toma |
On external-memory MST, SSSP and multi-way planar graph separation. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Kristoffer Vinther |
Engineering a Cache-Oblivious Sorting Algorith. |
ALENEX/ANALC |
2004 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal |
Cache-Oblivious Algorithms and Data Structures. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh |
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
Computing the Quartet Distance between Evolutionary Trees in Time O(n log n). |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Quartet distance, Distance measures, Evolutionary trees, Hierarchical decompositions |
| 1 | Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas |
Optimal finger search trees in the pointer machine. |
J. Comput. Syst. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg |
Lower bounds for external memory dictionaries. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao |
Computing Refined Buneman Trees in Cubic Time. |
WABI |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz |
The Cost of Cache-Oblivious Searching. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg |
On the limits of cache-obliviousness. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
Cache-oblivious model, tall cache assumption, lower bound, sorting, permuting |
| 1 | Gerth Stølting Brodal, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas |
Optimal Solutions for the Temporal Precedence Problem. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Riko Jacob |
Cache oblivious search trees via binary trees of small height. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rune B. Lyngsø, Anna Östlin, Christian N. S. Pedersen |
Solving the String Statistics Problem in Time O(n log n). |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg |
Cache Oblivious Distribution Sweeping. |
ICALP |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Alstrup, Gerth Stølting Brodal, Inge Li Gørtz, Theis Rauhe |
Time and Space Efficient Multi-method Dispatching. |
SWAT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Riko Jacob |
Dynamic Planar Convex Hull. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
Planar computational geometry, dynamic convex hull, finger searches, data structure, lower bound, search trees |
| 1 | Gerth Stølting Brodal, Rolf Fagerberg |
Funnel Heap - A Cache Oblivious Priority Queue. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, George Lagogiannis, Christos Makris, Athanasios K. Tsakalidis, Kostas Tsichlas |
Optimal finger search trees in the pointer machine. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
finger search trees, update operations, complexity, data structures, balanced trees |
| 1 | Gerth Stølting Brodal, Maria Cristina Pinotti |
Comparator networks for binary heap construction. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen, Anna Östlin |
The Complexity of Constructing Evolutionary Trees Using Experiments. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen |
Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n). |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe |
Optimal static range reporting in one dimension. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela (eds.) |
Algorithm Engineering, 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings |
|
2001 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Srinivasan Venkatesh |
Improved bounds for dictionary look-up with one error. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe |
Pattern matching in dynamic texts. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Riko Jacob |
Dynamic Planar Convex Hull with Optimal Query Time. |
SWAT |
2000 |
DBLP BibTeX RDF |
|
| 1 | Lars Arge, Gerth Stølting Brodal, Laura Toma |
On External-Memory MST, SSSP, and Multi-way Planar Graph Separation. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Christian N. S. Pedersen |
Finding Maximal Quasiperiodicities in Strings. |
CPM |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Alstrup, Gerth Stølting Brodal, Theis Rauhe |
New Data Structures for Orthogonal Range Searching. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
general range reporting problem, two-dimensional semi-group range sum problem, data structures, data structures, search problems, orthogonal range searching |
| 1 | Gerth Stølting Brodal |
Priority queues on parallel machines. |
Parallel Computing |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Lars Arge, Gerth Stølting Brodal, Jeffrey Scott Vitter |
I/O-Efficient Dynamic Point Location in Monotone Planar Subdivisions. |
SODA |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rolf Fagerberg |
Dynamic Representation of Sparse Graphs. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Rune B. Lyngsø, Christian N. S. Pedersen, Jens Stoye |
Finding Maximal Pairs with Bounded Gap. |
CPM |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis |
A Parallel Priority Queue with Constant Time Operations. |
J. Parallel Distrib. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal |
Finger Search Trees with Constant Insertion Time. |
SODA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Jyrki Katajainen |
Worst-Case External-Memory Priority Queues. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Maria Cristina Pinotti |
Comparator Networks for Binary Heap Construction. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Jesper Larsson Träff, Christos D. Zaroliagis |
A Parallel Priority Data Structure with Applications. (PDF / PS) |
IPPS |
1997 |
DBLP DOI BibTeX RDF |
parallel priority data structure, algorithm running time, data structures, time complexity, iteration, parallel implementation, Dijkstra's algorithm, CREW PRAM |
| 1 | Gerth Stølting Brodal |
Predecessor Queries in Dynamic Integer Sets. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan |
The Randomized Complexity of Maintaining the Minimum. |
Nord. J. Comput. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal |
Partially Persistent Data Structures of Bounded Degree with Constant Update Time. |
Nord. J. Comput. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Chris Okasaki |
Optimal Purely Functional Priority Queues. |
J. Funct. Program. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal |
Worst-Case Efficient Priority Queues. |
SODA |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Shiva Chaudhuri, Jaikumar Radhakrishnan |
The Randomized Complexity of Maintaining the Minimum. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal |
Priority Queues on Parallel Machines. |
SWAT |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal, Leszek Gasieniec |
Approximate Dictionary Queries. |
CPM |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerth Stølting Brodal |
Fast Meldable Priority Queues. |
WADS |
1995 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")