{"entities":{"Q1868002":{"pageid":1878744,"ns":120,"title":"Item:Q1868002","lastrevid":69534132,"modified":"2026-04-13T07:39:37Z","type":"item","id":"Q1868002","labels":{"en":{"language":"en","value":"Experimental algorithmics. From algorithm design to robust and efficient software"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1900865"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1868002$C81A4735-3BBA-401D-AB39-B8E96DED158B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"34ca47a76b20f5ee06ab74f0c31e22a1a31d798d","datavalue":{"value":{"text":"Experimental algorithmics. From algorithm design to robust and efficient software","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1868002$3337236F-2ED5-4BD0-BF16-881ADE45D1AB","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"1483391c94a5f0a5cc8243015fe48902b097e1d6","datavalue":{"value":"1011.68694","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1868002$8842152A-C585-4CF3-BF53-02DA6D9DD27E","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1868002$35F13650-0755-4896-A873-DBAC4D4826BC","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ae7235402c0b574ed2e2213feb9e21452b645cac","datavalue":{"value":{"time":"+2003-04-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1868002$D8EDE14F-B45F-4FC3-86DF-5269D38AD488","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"29cc90051cb05391b3de30adb3f20c3e067fa15b","datavalue":{"value":"http://link.springer.de/link/service/series/0558/tocs/t2547.htm","type":"string"},"datatype":"url"},"type":"statement","id":"Q1868002$08B3A25C-FF07-4B28-A407-1FA8C1510D26","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"05349cdefe351b692d4cb39ff4fb65a2c306dada","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Bader, David A.; Moret, Bernard M. E.; Sanders, Peter}, Algorithm engineering for parallel computation, 1-23 [Zbl 1026.68760]  \\textit{Demetrescu, Camil; Finocchi, Irene; Italiano, Giuseppe F.; N\u00e4her, Stefan}, Visualization in algorithm engineering: Tools and techniques, 24-50 [Zbl 1026.68768]  \\textit{Fellows, Michael R.}, Parameterized complexity: The main ideas and connections to practical computing, 51-77 [Zbl 1026.68773]  \\textit{Ladner, Richard E.; Fortna, Ray; Nguyen, Bao-Hoang}, A comparison of cache aware and cache oblivious static search trees using program instrumentation, 78-92 [Zbl 1026.68790]  \\textit{McGeoch, Catherine; Sanders, Peter; Fleischer, Rudolf; Cohen, Paul R.; Precup, Doina}, Using finite experiments to study asymptotic performance, 93-126 [Zbl 1026.68796]  \\textit{Meinel, Christoph; Sack, Harald; Wagner, Arno}, WWW. BDD-Portal. ORG: An experimentation platform for binary decision diagram algorithms, 127-138 [Zbl 1026.68798]  \\textit{Meinel, Christoph; Stangier, Christian}, Algorithms and heuristics in VLSI design, 139-162 [Zbl 1026.68797]  \\textit{Moret, Bernard M. E.; Warnow, Tandy}, Reconstructing optimal phylogenetic trees: A challenge in experimental algorithmics, 163-180 [Zbl 1026.68801]  \\textit{Sanders, Peter}, Presenting data from experiments in algorithmics, 181-196 [Zbl 1026.68816]  \\textit{Spirakis, Paul G.; Zaroliagis, Christos D.}, Distributed algorithm engineering, 197-228 [Zbl 1026.68819]  \\textit{Zaroliagis, Christos D.}, Implementations and experimental studies of dynamic graph algorithms, 229-278 [Zbl 1026.68829]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1868002$154DDC10-5764-4221-BF44-3A1FA1F121C9","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"61f5e4db0e91212ef2106e3db512d71730a68751","datavalue":{"value":"68U99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1868002$314AB69F-F0F8-4C68-BEB3-0A70D283B26D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fa684c8d52e9da1094b0c2d762898ace723c7ee3","datavalue":{"value":"68Wxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1868002$6F4BB105-129C-4095-BEFA-E6577A3B6567","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1868002$6805F566-FD99-446D-B5B9-ED3B303F693C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35c3f01235ccba091e1644bb05c86f53d45fd7f7","datavalue":{"value":"68N19","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1868002$1B9FBEE6-F887-435A-9302-0F020D10068C","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5e75e08879fdb197369b34ac7665b7c956de8aee","datavalue":{"value":"1900865","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1868002$219D87AF-12C5-4F66-80B8-D3638A75DD23","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c5643b5dfd450ea02f8762ebbb6e3c2a92c7f184","datavalue":{"value":"Experimental algorithmics","type":"string"},"datatype":"string"},"type":"statement","id":"Q1868002$946217DE-2182-4119-BA83-C12C99C6812F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a76c5ff8f81e20b12c902447489fcc3993998de0","datavalue":{"value":"Algorithm design","type":"string"},"datatype":"string"},"type":"statement","id":"Q1868002$772882A7-C924-435B-B6ED-593931116435","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"20093d9ac07002fe5f0f815323db75493ebc68f4","datavalue":{"value":"Robust software","type":"string"},"datatype":"string"},"type":"statement","id":"Q1868002$6BB30B16-B297-4DC8-9224-BBA908C754C3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3d8a2c565e1485bc128e9afddba285d2ae1de15c","datavalue":{"value":"Efficient software","type":"string"},"datatype":"string"},"type":"statement","id":"Q1868002$0AB6D617-B4B9-4B5C-8842-41D12E4F43B1","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1868002$FC1358CB-8978-4A52-8EF5-7C167D9CCC52","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"fe8365a16c2f8770dac9dbbe2e568739bf4fd4e5","datavalue":{"value":"10.1007/3-540-36383-1","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1868002$8003CAF0-EEDF-4035-9CCF-9ADD13350FB5","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"52b0a82ffc4fa859b3b731ed83cf39758e19ff00","datavalue":{"value":"W4213175742","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1868002$E55BB56D-40A2-43A7-AC7D-268012FE375E","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Experimental algorithmics. From algorithm design to robust and efficient software","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Experimental_algorithmics._From_algorithm_design_to_robust_and_efficient_software"}}}}}