|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11526 occurrences of 4704 keywords
|
|
|
Results
Found 29774 publication records. Showing 29763 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | W. Dale Brownawell, Chee-Keng Yap |
Lower bounds for zero-dimensional projections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2009, Seoul, Republic of Korea, July 29-31, 2009, Proceedings, pp. 79-86, 2009, ACM, 978-1-60558-609-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
chow forms, exact numerical algorithms, nullstellensatz, transcendence theory, zero bounds, exact geometric computation |
16 | Nitin Saxena 0001 |
Diagonal Circuit Identity Testing and Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 60-71, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
identity testing, depth 3, depth 4, lower bounds, determinant, arithmetic circuit, permanent |
16 | Maurice J. Jansen |
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 407-418, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multilinear polynomials, algebraic branching programs, Computational complexity, lower bounds, arithmetical circuits |
16 | Andy Rupp, Gregor Leander, Endre Bangerter, Alexander W. Dent, Ahmad-Reza Sadeghi |
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASIACRYPT ![In: Advances in Cryptology - ASIACRYPT 2008, 14th International Conference on the Theory and Application of Cryptology and Information Security, Melbourne, Australia, December 7-11, 2008. Proceedings, pp. 489-505, 2008, Springer, 978-3-540-89254-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Generic Group Model, Hardness Conditions, Lower Bounds, Straight-Line Programs |
16 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 128-139, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Constant Depth, Lower Bounds, Separations, Arithmetic Circuits |
16 | Vicky Henderson, David Hobson, William Shaw, Rafal Wojakowski |
Bounds for in-progress floating-strike Asian options using symmetry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 151(1), pp. 81-98, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Asian options, Floating strike Asian options, Put call symmetry, Change of numéraire, Bounds |
16 | Ashutosh Sabharwal, Ahmad Khoshnevis, Edward W. Knightly |
Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 15(3), pp. 533-545, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
capacity bounds, measurement overhead, opportunistic access, 802.11, CSMA/CA, multi-channel |
16 | Ajay Chander, David Espinosa, Nayeem Islam, Peter Lee 0001, George C. Necula |
Enforcing resource bounds via static verification of dynamic checks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 29(5), pp. 28, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Resource bounds, dynamic, static |
16 | Wendelin L. F. Degen |
Sharp error bounds for piecewise linear interpolation of planar curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 79(2-4), pp. 143-151, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
curvature, Error bounds, linear interpolation |
16 | Nicole Schweikardt |
Machine models and lower bounds for query processing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 11-13, 2007, Beijing, China, pp. 41-52, 2007, ACM, 978-1-59593-685-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
machine models, XML, complexity, query processing, lower bounds, data streams, survey, external memory |
16 | Sylvain Perifel |
Symmetry of Information and Nonuniform Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, Second International Symposium on Computer Science in Russia, CSR 2007, Ekaterinburg, Russia, September 3-7, 2007, Proceedings, pp. 315-327, 2007, Springer, 978-3-540-74509-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
nonuniform lower bounds, resource-bounded Kolmogorov complexity, symmetry of information, computational complexity |
16 | Rajeev Motwani 0001, Assaf Naor, Rina Panigrahy |
Lower bounds on locality sensitive hashing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, Arizona, USA, June 5-7, 2006, pp. 154-157, 2006, ACM, 1-59593-340-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
lower bounds, nearest neighbor search, locality sensitive hashing |
16 | Dinakar Dhurjati, Vikram S. Adve |
Backwards-compatible array bounds checking for C with very low overhead. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: 28th International Conference on Software Engineering (ICSE 2006), Shanghai, China, May 20-28, 2006, pp. 162-171, 2006, ACM, 1-59593-375-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
automatic pool allocation, compilers, programming languages, array bounds checking, region management |
16 | Nir Ailon, Bernard Chazelle |
Lower bounds for linear degeneracy testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(2), pp. 157-171, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
linear decision trees, Computational geometry, lower bounds |
16 | Hettihe P. Dharmasena, Ramachandran Vaidyanathan |
Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 53(12), pp. 1535-1546, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Multiple bus networks, binary tree algorithms, bus loading, interconnection networks, lower bounds |
16 | Ran Raz |
Resolution lower bounds for the weak pigeonhole principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 51(2), pp. 115-138, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
P different than NP, computational complexity, Lower bounds, propositional logic, proof complexity |
16 | Nir Ailon, Bernard Chazelle |
Lower bounds for linear degeneracy testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004, pp. 554-560, 2004, ACM, 1-58113-852-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
linear decision trees, lower, computational geometry, bounds |
16 | Alejandro Murua |
Upper Bounds for Error Rates of Linear Combinations of Classifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 24(5), pp. 591-602, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Exponential bounds, weakly dependent classifiers, machine learning, classification trees |
16 | Matthias Krause 0001, Stefan Lucks |
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(4), pp. 297-313, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
$ textit{TC}^{0} $, lower bounds.¶ Subject classification. 68Q25, Pseudorandomness, 94A60, function generators |
16 | Frederic Green |
A complex-number Fourier technique for lower bounds on the Mod-m degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 9(1), pp. 16-38, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
modulo functions, lower bounds, Circuit complexity, Fourier methods |
16 | Dima Grigoriev, Alexander A. Razborov |
Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 10(6), pp. 465-487, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Exponential lower bounds, Depth 3 arithmetic circuits, Finite fields |
16 | Rosario Gennaro, Luca Trevisan |
Lower Bounds on the Efficiency of Generic Cryptographic Constructions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 305-313, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
generic cryptographic constructions, universal one-way hash functions, black-box access, Impagliazzo-Rudich model, cryptography, lower bounds, random number generation, file organisation, pseudo-random generators, one-way permutations |
16 | Peter Auer |
Using Upper Confidence Bounds for Online Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 270-279, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
upper confidence bounds, exploitation decision, exploration decision, adversarial bandit problem, associative reinforcement learning, linear value functions, learning (artificial intelligence), statistical analysis, statistics, online learning, random processes, random process, uncertainty handling, uncertain information |
16 | Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee |
Super-linear time-space tradeoff lower bounds for randomized computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 169-179, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
super-linear time-space tradeoff lower bounds, deterministic RAM algorithms, deterministic Boolean branching programs, computational complexity, lower bound, probability, randomised algorithms, decision problems, branching program, time-space tradeoff, randomized computation |
16 | András Antos, Luc Devroye, László Györfi |
Lower Bounds for Bayes Error Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 21(7), pp. 643-645, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
lower bounds, Discrimination, statistical pattern recognition, rates of convergence, nonparametric estimation, Bayes error |
16 | Lars Kruse, Eike Schmidt, Gerd Jochens, Wolfgang Nebel |
Lower and upper bounds on the switching activity in scheduled data flow graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISLPED ![In: Proceedings of the 1999 International Symposium on Low Power Electronics and Design, 1999, San Diego, California, USA, August 16-17, 1999, pp. 115-120, 1999, ACM, 1-58113-133-X. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
bounds estimation, high-level power estimation |
16 | Walter Krämer |
A Priori Worst Case Error Bounds for Floating-Point Computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 47(7), pp. 750-756, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Rigorous error bounds, table-lookup algorithms, elementary function algorithms, automation of error analysis |
16 | Ulf Grenander, Michael I. Miller, Anuj Srivastava |
Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 20(8), pp. 790-802, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Hilbert-Schmidt bounds, orthogonal groups, performance analysis, Pose estimation, Bayesian approach, ATR |
16 | Joe Kilian, Erez Petrank, Charles Rackoff |
Lower Bounds for Zero Knowledge on the Internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 484-492, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Lower Bounds, Zero Knowledge, Asynchronous Protocols |
16 | Dima Grigoriev, Alexander A. Razborov |
Exponential Complexity Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions Over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 269-278, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
depth 3 arithmetic circuits, exponential lower bounds, approximating by sparse polynomials |
16 | Nirmal R. Saxena, Edward J. McCluskey |
Parallel Signatur Analysis Design with Bounds on Aliasing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 46(4), pp. 425-438, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
aliasing probability bounds, parallel signature designs, multiple input signature registers (MISR), linear feedback shift registers, random testing, Signature analysis |
16 | Jeff Erickson 0001 |
Better Lower Bounds for Halfspace Emptiness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pp. 472-481, 1996, IEEE Computer Society, 0-8186-7594-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
halfspace emptiness, query region, computational complexity, lower bounds, points, polyhedron, facets, partitioning algorithms, hyperplanes, polylogarithmic factors |
16 | Noam Nisan, Avi Wigderson |
Lower Bounds for Arithmetic Circuits via Partial Serivatives (Preliminary Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 16-25, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
restricted classes, computational complexity, lower bounds, digital arithmetic, polynomials, logic circuits, arithmetic circuits, multivariate polynomials, complexity measure, minimisation of switching nets, partial derivatives |
16 | Amos Beimel, Anna Gál, Mike Paterson |
Lower Bounds for Monotone Span Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 674-681, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
linear algebraic model, span programs, symmetric branching, formula size, cryptography, lower bounds, secret-sharing, programming theory, computation theory, monotone span programs |
16 | C. Greg Plaxton |
Tight Bounds for a Distributed Selection Game with Applications to Fixed-Connection Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 114-122, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
distributed selection game, fixed-connection machines, abstract communication game, hypercubic machine, computational complexity, lower bound, hypercube networks, tight bounds |
16 | Xiaotie Deng, Patrick W. Dymond |
Efficient routing and message bounds for optimal parallel algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '95, The 9th International Parallel Processing Symposium, April 25-28, 1995, Santa Barbara, California, USA, pp. 556-562, 1995, IEEE Computer Society, 0-8186-7074-6. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
message bounds, round-robin message-delivery, routing, parallel algorithms, computational complexity, routing algorithm, network routing, interprocessor communication, optimal parallel algorithms, crossbar networks, h-relations |
16 | Mark A. Heap, M. Ray Mercer |
Least Upper Bounds an OBDD Sizes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(6), pp. 764-767, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
least upper bounds, OBDD sizes, exact equations, nonterminal vertexes, reduced ordered binary decision diagrams, Boolean functions, decoding |
16 | S. A. Ali, G. Robert Redinbo |
Tight Lower Bounds on the Detection Probabilities of Single Faults at Internal Signal Lines in Combinational Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 43(12), pp. 1426-1428, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
tight lower bounds, internal signal lines, fault diagnosis, logic testing, combinational circuits, combinational circuits, random testing, detection probabilities, single faults |
16 | Qian-Ping Gu, Jun Gu |
Algorithms and Average Time Bounds of Sorting on a Mesh-Connected Computer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(3), pp. 308-315, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
average time bounds, mesh-connectedcomputer, wraparound connections, distancebound, indexing schemes, average time complexity, parallel algorithms, parallel algorithms, computational complexity, multiprocessor interconnection networks, sorting, sorting, communication complexity, queue size, parallel sorting algorithms |
16 | Anil Kamath, Rajeev Motwani 0001, Krishna V. Palem, Paul G. Spirakis |
Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 592-603, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
tail bounds, satisfiability threshold conjecture, random allocation, random 3-SAT formulas, randomized algorithms, upper bound, probabilistic analysis, structural property, occupancy |
16 | Dima Grigoriev, Nicolai N. Vorobjov Jr. |
Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 548-552, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
complexity lower bounds, computation trees, elementary transcendental function gates, membership, arithmetic operations, algebraic functions, transcendental functions, convex polyhedron |
16 | Abhiram G. Ranade, Saul Schleimer, Daniel Shawcross Wilkerson |
Nearly Tight Bounds for Wormhole Routing ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 347-355, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
nearly tight bounds, high probability, lower bound, trees, routing algorithm, wormhole routing, optimal algorithms, two-dimensional mesh, Butterfly networks, multidimensional meshes |
16 | Bernard Chazelle |
A Spectral Approach to Lower Bounds ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 674-682, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
median eigenvalue, nonlinear lower bound, halfplane range searching, nontrivial lower bound, linear circuit complexity, linear map, geometric set system, lower bounds, range searching |
16 | Johan Håstad, Stasys Jukna, Pavel Pudlák |
Top-Down Lower Bounds for Depth 3 Circuits ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 124-129, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
nonmonotone circuits, top-down lower bounds, depth 3 circuits, depth 3 AND-OR-NOT circuits, strong lower bound, top-down argument |
16 | Dan Halperin, Micha Sharir |
Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 382-391, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
single connected component, near-quadratic bounds, motion planning problem, polygonal environment, arbitrary k-sided polygonal robot, polygon, combinatorial complexity |
16 | Javed A. Aslam, Scott E. Decatur |
General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Bounding ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 282-291, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
statistical query learning, hypothesis boosting, complexity, noise, PAC learning, general bounds |
16 | Micha Sharir |
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 498-507, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
almost tight upper bounds, higher dimensions, constant maximum degree, constant of proportionality, Davenport-Schinzel sequences, randomized algorithm, combinatorial complexity, lower envelopes, surface patches |
16 | Chung Keung Poon |
Space Bounds for Graph Connectivity Problems on Node-named JAGs and Node-ordered JAGs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 218-227, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
nondeterministic NO-JAG, graph connectivity problems, node-named JAGs, node-ordered JAGs, nondeterministic Turing machine, space bounds |
16 | Nirmal R. Saxena, Piero Franco, Edward J. McCluskey |
Simple Bounds on Serial Signature Analysis Aliasing for Random Testing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(5), pp. 638-645, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
serial signature analysis aliasing, signature polynomial, simple bounds, linear cellular automaton, intermediate signatures, computational complexity, logic testing, probability, integrated circuit testing, random testing, finite automata, aliasing probability, linear finite state machine |
16 | Eric Allender, Lane A. Hemachandra |
Lower Bounds for the Low Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 39(1), pp. 234-251, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
low hierarchy, sparse sets, lower bounds |
16 | C. Greg Plaxton, Bjorn Poonen, Torsten Suel |
Improved Lower Bounds for Shellsort ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 226-235, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
nonmonotone increment sequences, Shellsort, proof idea, lower bounds |
16 | Don Coppersmith, Baruch Schieber |
Lower Bounds on the Depth of Monotone Arithmetic Computations (Extended Summary) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 288-295, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
monotone arithmetic computations, binary computation tree, alternating 5-3 trees, computational complexity, lower bounds, depth, tight bound, arithmetic expression |
16 | Avrim Blum, Howard J. Karloff, Yuval Rabani, Michael E. Saks |
A Decomposition Theorem and Bounds for Randomized Server Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 197-207, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
randomized server problems, k-server problem, arbitrary metric spaces, lower bound, motion-planning, bounds, competitive ratio, decomposition theorem |
16 | Gloria Kissin |
Upper and Lower Bounds on Switching Energy in VLSI. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 38(1), pp. 222-254, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
1-switchable functions, AND function, CID VLSI circuit, OR functions, USM, circuit scheme, compare functions, parity function, switching energy, uniswitch, energy-efficient, embedding, energy consumption, layout, average-case analysis, addition, upper and lower bounds |
16 | David R. Karger, Daphne Koller, Steven J. Phillips |
Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 560-568, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
path-comparison-based algorithm, hidden paths algorithm, edge weights, lower bound, time bounds, weighted graphs, all-pairs shortest paths |
16 | Jeff Edmonds, Steven Rudich, Russell Impagliazzo, Jirí Sgall |
Communication Complexity Towards Lower Bounds on Circuit Depth ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 249-257, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
almost optimal lower bound, circuit depth, circuit depth complexity, n-bit Boolean function, communication game characterization, universal composition relation, lower bounds |
16 | Amir M. Ben-Amram, Zvi Galil |
Lower Bounds for Data Structure Problems on RAMs (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 622-631, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
union-find problem, average case time, data structure problems, output variability, problem variability, unbounded integers, lower bounds, upper bound, RAMs, worst case time |
16 | Peter W. Shor |
How to Pack Better than Best Fit: Tight Bounds for Average-Case On-Line Bin Packing ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 752-759, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
2-D strip packing problem, ball packing, average-case online bin packing, expected wasted space, lowest bound, stochastic rightward matching problem, half-infinite strip, online algorithm, tight bounds, rectangle packing |
16 | Anna Gál |
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 32nd Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1-4 October 1991, pp. 594-601, 1991, IEEE Computer Society, 0-8186-2445-0. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
block sensitivity, reliable Boolean circuits, noisy gates, fixed positive probability, complexity, lower bounds, Boolean function |
16 | Ding-Zhu Du, Frank K. Hwang |
An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 76-85, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
concave function, lower bounds, minimum spanning trees, polytope, function minimization, continuous functions, Steiner ratio, Steiner minimum trees, Euclidean plane |
16 | Roman Smolensky |
On Interpolation by Analytic Functions with Special Properties and Some Weak Lower Bounds on the Size of Circuits with Symmetric Gates ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume II, pp. 628-631, 1990, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
weak circuit lower bounds, symmetric gates, interpolation, Boolean function, partial derivatives, analytic functions |
16 | Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas |
Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 285-296, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
asymptotically tight bounds, random fault model, faulty arrays of processors, worst-case fault model, low-dimensional arrays, congestion embedding, route, sort, 3-D, systolic algorithms, knot theory, 2-D |
16 | Michael Kharitonov, Andrew V. Goldberg, Moti Yung |
Lower Bounds for Pseudorandom Number Generators ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 242-247, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
machine-based complexity, lower bounds, pseudorandom number generators |
16 | Mark H. Overmars, Chee-Keng Yap |
New upper bounds in Klee's measure problem (extended abstract) ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988, pp. 550-556, 1988, IEEE Computer Society, 0-8186-0877-3. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
Klee measure problem, time-space upper bound, Euclidean d-space, inclusion/exclusion principle, trellises, partition, streaming, upper bounds, dimensions |
16 | Constantine D. Polychronopoulos, Utpal Banerjee |
Processor Allocation for Horizontal and Vertical Parallelism and Related Speedup Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 36(4), pp. 410-420, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
vector machines, DO all and DO across loops, parallel Fortran programs, program speedup, speedup bounds, multiprocessors, program graphs |
16 | Shinji Nakamura, Gerald M. Masson |
Lower Bounds on Crosspoints in Concentrators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 31(12), pp. 1173-1179, 1982. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
crosspoint, interconnection networks, lower bounds, Capacity, concentrators |
16 | Nikhil Jain, Yogish Sabharwal |
Optimal bucket algorithms for large MPI collectives on torus interconnects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: Proceedings of the 24th International Conference on Supercomputing, 2010, Tsukuba, Ibaraki, Japan, June 2-4, 2010, pp. 27-36, 2010, ACM, 978-1-4503-0018-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
communication, MPI, collective, torus network |
16 | Xiang-Yang Li 0001 |
Multicast capacity of wireless ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(3), pp. 950-961, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
scheduling, optimization, multicast, broadcast, wireless ad hoc networks, capacity, unicast, VC-dimension |
16 | Alexandre Belloni, Robert M. Freund |
A geometric analysis of Renegar's condition number, and its interplay with conic curvature. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 119(1), pp. 95-107, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 90C31, 52A20 |
16 | Sumit Gulwani, Sagar Jain, Eric Koskinen |
Control-flow refinement and progress invariants for bound analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PLDI ![In: Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2009, Dublin, Ireland, June 15-21, 2009, pp. 375-385, 2009, ACM, 978-1-60558-392-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
control-flow refinement, progress invariants, formal verification, program verification, termination, bound analysis |
16 | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
List decoding tensor products and interleaved codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 13-22, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Johnson bound, generalized hamming weights, interleaved codes, linear transformations, list decoding, tensor products |
16 | Saugata Basu, Nayantara Bhatnagar, Parikshit Gopalan, Richard J. Lipton |
Polynomials that Sign Represent Parity and Descartes' Rule of Signs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(3), pp. 377-406, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
16 | Shahar Sarid, Amir Shapiro |
Classifying the multi robot path finding problem into a quadratic competitive complexity class. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 52(2-4), pp. 169-203, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68Q25, 68T40, 11Y16, 93C85, 68Q17, 68Q15, 68W40, 68W15 |
16 | Lukas Kroc, Ashish Sabharwal, Bart Selman |
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings, pp. 127-141, 2008, Springer, 978-3-540-68154-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Shetal Shah, Krithi Ramamritham |
Handling Non-linear Polynomial Queries over Dynamic Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 24th International Conference on Data Engineering, ICDE 2008, April 7-12, 2008, Cancún, Mexico, pp. 1043-1052, 2008, IEEE Computer Society, 978-1-4244-1836-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Ran Raz, Amir Yehudayoff |
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 273-282, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Nikhil Bansal 0001, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko |
Dynamic pricing for impatient bidders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 726-735, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
16 | Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie 0002 |
Testing k-wise and almost k-wise independence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 496-505, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
almost k-wise independence, hidden clique, property testing, Fourier analysis, k-wise independence |
16 | Fabrice Tercinet, Emmanuel Néron, Christophe Lenté |
Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
4OR ![In: 4OR 4(4), pp. 297-317, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
MSC classification 90B35, 90C27 |
16 | Kaustubh R. Joshi, William H. Sanders, Matti A. Hiltunen, Richard D. Schlichting |
Automatic Recovery Using Bounded Partially Observable Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSN ![In: 2006 International Conference on Dependable Systems and Networks (DSN 2006), 25-28 June 2006, Philadelphia, Pennsylvania, USA, Proceedings, pp. 445-456, 2006, IEEE Computer Society, 0-7695-2607-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Sathish Gopalakrishnan, Marco Caccamo, Lui Sha |
Switch Scheduling and Network Design for Real-Time Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Real Time Technology and Applications Symposium ![In: 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2006), 4-7 April 2006, San Jose, California, USA, pp. 289-300, 2006, IEEE Computer Society, 0-7695-2516-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Peng Wang 0004, Baowen Xu, Jianjiang Lu, Dazhou Kang, Jin Zhou |
Mapping Ontology Relations: An Approach Based on Best Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APWeb ![In: Frontiers of WWW Research and Development - APWeb 2006, 8th Asia-Pacific Web Conference, Harbin, China, January 16-18, 2006, Proceedings, pp. 930-936, 2006, Springer, 3-540-31142-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Jonathan P. Pearce, Rajiv T. Maheswaran, Milind Tambe |
Solution sets for DCOPs and graphical games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 577-584, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
k-optimality, multiagent systems, constraint reasoning, DCOP |
16 | Steven P. Weber, Xiangying Yang, Jeffrey G. Andrews, Gustavo de Veciana |
Transmission capacity of wireless ad hoc networks with outage constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 51(12), pp. 4091-4102, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | S. T. Smith |
Statistical resolution limits and the complexified Cramér-Rao bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 53(5), pp. 1597-1609, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Weiliang Li, Xiang Gao, Ying Zhu, Visvanathan Ramesh, Terrance E. Boult |
On the Small Sample Performance of Boosted Classifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CVPR (2) ![In: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2005), 20-26 June 2005, San Diego, CA, USA, pp. 574-581, 2005, IEEE Computer Society, 0-7695-2372-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Shivani Agarwal 0001, Partha Niyogi |
Stability and Generalization of Bipartite Ranking Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 18th Annual Conference on Learning Theory, COLT 2005, Bertinoro, Italy, June 27-30, 2005, Proceedings, pp. 32-47, 2005, Springer, 3-540-26556-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Dazhou Kang, Hanwu Chen, Baowen Xu, Jianjiang Lu, Keyue Li, William C. Chu |
Approximate Information Retrieval for Heterogeneity Ontologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CW ![In: 4th International Conference on Cyberworlds (CW 2005), 23-25 November 2005, Singapore, pp. 539-544, 2005, IEEE Computer Society, 0-7695-2378-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Eunice E. Santos |
Optimal and Efficient Parallel Tridiagonal Solvers Using Direct Methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Supercomput. ![In: J. Supercomput. 30(2), pp. 97-115, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
tridiagonal solvers, parallel algorithms, linear algebra, parallel complexity, direct methods, LogP model |
16 | Valentina Damerow, Christian Sohler |
Extreme Points Under Random Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 264-274, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Josep Díaz, Maria J. Serna, Nicholas C. Wormald |
Computation of the Bisection Width for Random d-Regular Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 49-58, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Xiaohong Jiang 0001, Hong Shen 0001, Md. Mamun-ur-Rashid Khandker, Susumu Horiguchi |
Blocking behaviors of crosstalk-free optical Banyan networks on vertical stacking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 11(6), pp. 982-993, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
vertical stacking, multistage interconnection networks (MINs), blocking probability, switching networks, banyan networks |
16 | Satyanarayana V. Lokam |
Graph Complexity and Slice Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 36(1), pp. 71-88, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Jaikumar Radhakrishnan, Pranab Sen, Srinivasan Venkatesh 0001 |
The Quantum Complexity of Set Membership. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 34(4), pp. 462-479, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Tomohiro Yoneda, Tomoya Kitai, Chris J. Myers |
Automatic Derivation of Timing Constraints by Failure Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 14th International Conference, CAV 2002,Copenhagen, Denmark, July 27-31, 2002, Proceedings, pp. 195-208, 2002, Springer, 3-540-43997-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Trace theoretic verification, Timing constraints, Failure analysis, Timed circuits |
16 | Sunil Arya, Theocharis Malamatos, David M. Mount |
Space-efficient approximate Voronoi diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 34th Annual ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada, pp. 721-730, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Walter Krämer, Armin Bantle |
Automatic Forward Error Analysis for Floating Point Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 7(4), pp. 321-340, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz |
Distance labeling in graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 210-219, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
16 | Rudra Dutta, George N. Rouskas |
On optimal traffic grooming in WDM rings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS/Performance ![In: Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS/Performance 2001, June 16-20, 2001, Cambridge, MA, USA, pp. 164-174, 2001, ACM, 1-58113-334-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Gianfranco Bilardi, Andrea Pietracaprina, Paolo D'Alberto |
On the Space and Access Complexity of Computation DAGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 47-58, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #501 - #600 of 29763 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ 14][ 15][ >>] |
|