{"entities":{"Q1201875":{"pageid":1212624,"ns":120,"title":"Item:Q1201875","lastrevid":69874470,"modified":"2026-04-13T10:55:38Z","type":"item","id":"Q1201875","labels":{"en":{"language":"en","value":"The worst case analysis of algorithm on multiple stacks manipulation"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 98616"}},"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":"Q1201875$86B66EF9-DD05-41F4-B8A4-EE991C978A48","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d8dfaa9b80b48a25772fb5b43f206bdc8dd1c02d","datavalue":{"value":{"text":"The worst case analysis of algorithm on multiple stacks manipulation","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1201875$2FFE2B1E-A805-42E7-AEA0-C833E5A685CA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"6f8c71650bb995b3294c277875de82b7cd6924e9","datavalue":{"value":"0796.68113","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1201875$9DF21EDA-BA23-4248-BA0A-D9BED484B77C","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"bd722fad6b519d32a53b4902f2da9876350896ba","datavalue":{"value":"10.1016/0020-0190(92)90194-Z","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1201875$6BC727A8-1EF4-4FC2-922B-151DF3BF464D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"c5cab624ac67c1a8b1a109c92f3ba6fd6f97d5fb","datavalue":{"value":{"entity-type":"item","numeric-id":882253,"id":"Q882253"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1201875$48094325-923F-4639-9753-ABD57EE7E504","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"baceb33abb3c77e9145ffbd2d30789db3ce2a64e","datavalue":{"value":{"entity-type":"item","numeric-id":556119,"id":"Q556119"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1201875$328DE35F-7463-4E5F-97F5-984E7826C850","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1201875$53E72D32-679B-4388-8042-D67F34BCDFCE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b0879f591850b4f9f14b2c481d3e08995aa22089","datavalue":{"value":{"time":"+1993-01-17T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1201875$9770BCAF-2A0D-4932-B835-F3512BC3B180","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"68fec8f746fe06c7222199f8454a73b3256980b3","datavalue":{"value":"System developers frequently encounter programs which involve multiple stacks, each of which has dynamically varying size. In such a situation, keeping multiple stacks in a common area with sequential allocation with cause some trouble.   A number of possible solutions for overflow have been suggested. \\textit{D. E. Knuth} proposed a simple solution in reallocating memory by move operations [The art of computer programming. Vol. 1: Fundamental algorithms (1968; Zbl 0191.179)]. The method will be described in detail in the next section. He also analyzed the average number of movements when overflow occurs and got a formula concerning the number of stacks and pushed items. Here, we focus on the worst sequence of pushed data instead of the individual worst case, getting some interesting properties.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1201875$E509BD7B-5FA8-48FE-9041-18E3533A158A","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1201875$BE38BF47-49A1-4CFE-8CC8-CB5ACA7BC235","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"14cf74de25853c940589b125137b792dfb2d092b","datavalue":{"value":"68P05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1201875$2EB9816E-F3DD-46BF-8F67-63A70774E37F","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"7f74c9d2349190d5c864ad5347cc68b8218608a0","datavalue":{"value":"98616","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1201875$E07275AC-3895-47B7-BFC6-DA20D66F828C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"90bc349d6d55eb8026148892e900ce256ffdd986","datavalue":{"value":"analysis of algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1201875$99BCC15C-8230-48D4-AE75-90A8E60A49FD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"43d8de44b3f88bd19a871628a3509981cd748562","datavalue":{"value":"data structures","type":"string"},"datatype":"string"},"type":"statement","id":"Q1201875$33B9BE37-62C7-46A7-AA2E-03A35313300C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"58c8223d23fa3f18f604e9f50792384beef58e0a","datavalue":{"value":"multiple stacks","type":"string"},"datatype":"string"},"type":"statement","id":"Q1201875$B04107C8-75A9-4765-8B43-2F54A600208A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7dda5f58d54876bd01862800f88ef737a2f8c5be","datavalue":{"value":"overflow","type":"string"},"datatype":"string"},"type":"statement","id":"Q1201875$F5EA38DA-7EB2-4ED9-9216-87789E16B137","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5a2a0e31ee618c1e29dd7de2fc2317cf9e5fb7e2","datavalue":{"value":"reallocating memory","type":"string"},"datatype":"string"},"type":"statement","id":"Q1201875$9FC48006-FC98-4856-8991-9CCD5D72BE3B","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":"Q1201875$5EDA8060-8644-4DF7-8FB5-8CBCEA1C0A22","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"dc6482fda869c7df0ed32fd6ade8f790a1ff04cc","datavalue":{"value":{"entity-type":"item","numeric-id":5585020,"id":"Q5585020"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1201875$85AEE4BE-340C-440F-ADD5-1171DC57BCC7","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7a4deeef24638f82ce8ef357b1eb18434aaebd5d","datavalue":{"value":"https://doi.org/10.1016/0020-0190(92)90194-z","type":"string"},"datatype":"url"},"type":"statement","id":"Q1201875$4D871AD3-E71D-4CE6-9D38-57ED1E79981E","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"0b75d4e70a2fb6b032c41908369effafae1705ef","datavalue":{"value":"W2052430277","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1201875$129063D2-F59C-4878-8F60-485FC1990554","rank":"normal"}],"P1643":[{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3c4433645c01e725cffad2eca58fed6df193cb9d","datavalue":{"value":{"entity-type":"item","numeric-id":2365927,"id":"Q2365927"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6d750f152ccf5a004b1a9bf5603ce6151b0d7f74","datavalue":{"value":{"amount":"+0.754902720451355","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1201875$1C53B44C-D7C0-431E-B7C2-9E9C87CE2BD3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"3bf8e7280f8fa4efb93d9228f3177ba476bb4658","datavalue":{"value":{"entity-type":"item","numeric-id":4782734,"id":"Q4782734"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"6d750f152ccf5a004b1a9bf5603ce6151b0d7f74","datavalue":{"value":{"amount":"+0.754902720451355","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1201875$FA52A6EE-FEE9-48F7-A149-067C1527C0F2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"253ec6bc11507802fa36006edd87aa9671437db4","datavalue":{"value":{"entity-type":"item","numeric-id":4304060,"id":"Q4304060"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"40063c119b91f6e4ae8e56ab3d7939effd623816","datavalue":{"value":{"amount":"+0.7252147793769836","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1201875$8697808E-7959-4145-B4E0-4AAD67F4AD7A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"b003625775efab1fc2d32e4d8274aa932203241a","datavalue":{"value":{"entity-type":"item","numeric-id":1310924,"id":"Q1310924"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"c1089085919a4a42d94eec778495490ea238b2a6","datavalue":{"value":{"amount":"+0.7209464311599731","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1201875$C96C62E9-9CBF-429D-A458-3E6A4B606F3F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1643","hash":"eada747e394d1a070eb3d447c79e6de80344a841","datavalue":{"value":{"entity-type":"item","numeric-id":5439033,"id":"Q5439033"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","qualifiers":{"P1659":[{"snaktype":"value","property":"P1659","hash":"80c84a2e94f6266e61938a3d5271c1442bddccef","datavalue":{"value":{"amount":"+0.7134110927581787","unit":"1"},"type":"quantity"},"datatype":"quantity"}],"P1660":[{"snaktype":"value","property":"P1660","hash":"a327a09ea0305e98d5cf33bd4036320e19f2aed0","datavalue":{"value":{"entity-type":"item","numeric-id":6821328,"id":"Q6821328"},"type":"wikibase-entityid"},"datatype":"wikibase-item"}]},"qualifiers-order":["P1659","P1660"],"id":"Q1201875$CD72BA88-743B-4E10-BF98-EBBEDBB7C078","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"The worst case analysis of algorithm on multiple stacks manipulation","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/The_worst_case_analysis_of_algorithm_on_multiple_stacks_manipulation"}}}}}