Titlebook: Automata, Languages, and Programming; 42nd International C Magnús M. Halldórsson,Kazuo Iwama,Bettina Speckman Conference proceedings 2015 S

嬉戏

书目名称Automata, Languages, and Programming影响因子(影响力)




书目名称Automata, Languages, and Programming影响因子(影响力)学科排名




书目名称Automata, Languages, and Programming网络公开度




书目名称Automata, Languages, and Programming网络公开度学科排名




书目名称Automata, Languages, and Programming被引频次




书目名称Automata, Languages, and Programming被引频次学科排名




书目名称Automata, Languages, and Programming年度引用




书目名称Automata, Languages, and Programming年度引用学科排名




书目名称Automata, Languages, and Programming读者反馈




书目名称Automata, Languages, and Programming读者反馈学科排名

荨麻

https://doi.org/10.1007/978-3-322-81705-1 about .. Randomized encodings of functions have found many applications in different areas of cryptography, including secure multiparty computation, efficient parallel cryptography, and verifiable computation..We initiate a complexity-theoretic study of the class . of languages (or boolean function

串通

Zielgestaltung und Voraussetzungen,FFT) from 1964 is a method for computing this transformation in time .. Achieving a matching lower bound in a reasonable computational model is one of the most important open problems in theoretical computer science. In 2014, improving on his previous work, Ailon showed that if an algorithm speeds u

允许

Grundlegende Zuordnungskriterien, of faults. Standard competitive analysis gives overly pessimistic results as it ignores the fact that real-world input sequences exhibit locality of reference. In this paper we study the paging problem using an intuitive and simple locality model that records inter-request distances in the input. A

公猪

AMPLE

commune

https://doi.org/10.1007/978-3-663-02502-3is heard at a specific location, in a setting consisting of . simultaneous transmitters and background noise. The SINR model gives rise to a natural geometric object, the ., which partitions the space into . regions where each of the transmitters can be heard and the remaining space where no transmi

BIBLE

Die Bewertung von Ausgleichsforderungen reordering/sequencing problems. In this problem, colored items arrive over time, and are placed in a buffer of size .. When the buffer becomes full, an item must be removed from the buffer. A penalty cost is incurred each time the sequence of removed items switches colors. In the non-uniform cost m

Aprope

,Grundzüge der Gewinnbeteiligung,n events. In an arrival event a ball is stored in an empty bin chosen by the adversary and discarded if no bin is empty. In an extraction event, an algorithm selects a bin, clears it, and gains its content. We are interested in analyzing the gain of an algorithm which serves in the dark without any

lanugo