Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jea/jea6.bht:"
@article{DBLP:journals/jea/ArgeTV01, author = {Lars Arge and Laura Toma and Jeffrey Scott Vitter}, title = {I/O-Efficient Algorithms for Problems on Grid-Based Terrains}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {1}, year = {2001}, url = {https://doi.org/10.1145/945394.945395}, doi = {10.1145/945394.945395}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/ArgeTV01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/DemestrescuF01, author = {Camil Demetrescu and Irene Finocchi}, title = {Removing Cycles for Minimizing Crossings}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {2}, year = {2001}, url = {https://doi.org/10.1145/945394.945396}, doi = {10.1145/945394.945396}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/DemestrescuF01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/FrigioniMNZ01, author = {Daniele Frigioni and Tobias Miller and Umberto Nanni and Christos D. Zaroliagis}, title = {An Experimental Study of Dynamic Algorithms for Transitive Closure}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {9}, year = {2001}, url = {https://doi.org/10.1145/945394.945403}, doi = {10.1145/945394.945403}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/FrigioniMNZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/GabowK01, author = {Harold N. Gabow and Tadayoshi Kohno}, title = {A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {3}, year = {2001}, url = {https://doi.org/10.1145/945394.945397}, doi = {10.1145/945394.945397}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/GabowK01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/IyerKRT01, author = {Raj Iyer and David R. Karger and Hariharan Rahul and Mikkel Thorup}, title = {An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {4}, year = {2001}, url = {https://doi.org/10.1145/945394.945398}, doi = {10.1145/945394.945398}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/IyerKRT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/Liberatore01, author = {Vincenzo Liberatore}, title = {Caching and Scheduling for Broadcast Disk Systems}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {5}, year = {2001}, url = {https://doi.org/10.1145/945394.945399}, doi = {10.1145/945394.945399}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/Liberatore01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/MatiasRS01, author = {Yossi Matias and Nasir M. Rajpoot and S{\"{u}}leyman Cenk Sahinalp}, title = {The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {10}, year = {2001}, url = {https://doi.org/10.1145/945394.945404}, doi = {10.1145/945394.945404}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/MatiasRS01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/NarasimhanZ01, author = {Giri Narasimhan and Martin Zachariasen}, title = {Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {6}, year = {2001}, url = {https://doi.org/10.1145/945394.945400}, doi = {10.1145/945394.945400}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jea/NarasimhanZ01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/RahmanR01, author = {Naila Rahman and Rajeev Raman}, title = {Adapting Radix Sort to the Memory Hierarchy}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {7}, year = {2001}, url = {https://doi.org/10.1145/945394.945401}, doi = {10.1145/945394.945401}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/RahmanR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jea/StallmannBG01, author = {Matthias F. M. Stallmann and Franc Brglez and Debabrata Ghosh}, title = {Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization}, journal = {{ACM} J. Exp. Algorithmics}, volume = {6}, pages = {8}, year = {2001}, url = {https://doi.org/10.1145/945394.945402}, doi = {10.1145/945394.945402}, timestamp = {Thu, 25 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jea/StallmannBG01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.