|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 475 occurrences of 361 keywords
|
|
|
Results
Found 1218 publication records. Showing 1216 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
182 | 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 |
|
171 | Venkatesan Guruswami, Atri Rudra |
Soft Decoding, Dual BCH Codes, and Better List-Decodable e-Biased Codes. ![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. 163-174, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
155 | Yuh-Jye Lee, Wen-Feng Hsieh, Chien-Ming Huang 0002 |
epsilon-SSVR: A Smooth Support Vector Machine for epsilon-Insensitive Regression. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 17(5), pp. 678-685, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
epsilon{hbox{-}}{rm{insensitive}} loss function, epsilon{hbox{-}}{rm{smooth}} support vector regression, Newton-Armijo algorithm, support vector machine, kernel method |
96 | Josée Desharnais, François Laviolette, Mathieu Tracol |
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QEST ![In: Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 14-17 September 2008, Saint-Malo, France, pp. 264-273, 2008, IEEE Computer Society, 978-0-7695-3360-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
96 | Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci |
Area-Universal Circuits with Constant Slowdown. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ARVLSI ![In: 18th Conference on Advanced Research in VLSI (ARVLSI '99), 21-24 March 1999, Atlanta, GA, USA, pp. 89-98, 1999, IEEE Computer Society, 0-7695-0056-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
90 | Phillip G. Bradford, Vasilis Capoyleas |
Weak epsilon-Nets for Points on a Hypersphere. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 18(1), pp. 83-91, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
85 | Ran Raz |
A Counterexample to Strong Parallel Repetition. ![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. 369-373, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
75 | Dana Moshkovitz, Ran Raz |
Two Query PCP with Sub-Constant Error. ![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. 314-323, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
68 | Siegfried M. Rump |
A Note on Epsilon-Inflation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliab. Comput. ![In: Reliab. Comput. 4(4), pp. 371-375, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
67 | Georg Moser, Richard Zach |
The Epsilon Calculus and Herbrand Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 82(1), pp. 133-155, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Hilbert's ?-calculus, epsilon theorems, Herbrand's theorem, proof complexity |
64 | Saurabh Ray, Nabil H. Mustafa |
Weak epsilon-nets have basis of size o(1/epsilon log (1/epsilon)) in any dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 239-244, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
hitting convex sets, weak epsilon nets, discrete geometry, combinatorial geometry |
64 | Dimitris Fotakis 0001, Rasmus Pagh, Peter Sanders 0001, Paul G. Spirakis |
Space Efficient Hash Tables with Worst Case Constant Access Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 271-282, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
64 | Kyuseok Shim, Ramakrishnan Srikant, Rakesh Agrawal 0001 |
High-Dimensional Similarity Joins. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 14(1), pp. 156-171, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
similar time sequences, Data mining, similarity join |
64 | Subhash Khot |
On the power of unique 2-prover 1-round games. ![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. 767-775, 2002, ACM, 1-58113-495-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
64 | Subhash Khot |
On the Power of Unique 2-Prover 1-Round Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 25, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
2-prover games, Hardness of approximation, probabilistically checkable proofs |
64 | Ian Agol, Joel Hass, William P. Thurston |
3-MANIFOLD KNOT GENUS is NP-complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 24, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
2-prover games, Hardness of approximation, probabilistically checkable proofs |
58 | Wolfgang Mader 0001 |
Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 21(2), pp. 251-265, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 05C83, 05C35 |
53 | Jagan Sankaranarayanan, Hanan Samet |
Distance Oracles for Spatial Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 652-663, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
53 | Yuh-Rau Wang, Shi-Jinn Horng, Chin-Hsiung Wu |
Efficient Algorithms for the All Nearest Neighbor and Closest Pair Problems on the Linear Array with a Reconfigurable Pipelined Bus System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 16(3), pp. 193-206, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
LARPBS, reconfigurable bus model, Parallel algorithm, closest pair, all nearest neighbors |
53 | Yuh-Rau Wang, Shi-Jinn Horng |
An O(1)Time Algorithm for the 3D Euclidean Distance Transform on the CRCW PRAM Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 14(10), pp. 973-982, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Computer vision, parallel algorithm, image processing, Voronoi diagram, Euclidean distance transform, CRCW PRAM model |
53 | Amnon Ta-Shma |
Almost Optimal Dispersers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(1), pp. 123-145, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 68Q01, 68R10 |
53 | Jeffrey C. Jackson, Christino Tamon, Tomoyuki Yamakami |
Quantum DNF Learnability Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 595-604, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
53 | Elchanan Mossel, Christopher Umans |
On the Complexity of Approximating the VC Dimension. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 220-225, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
53 | Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy |
Efficient Testing of Large Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(4), pp. 451-476, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68R10, 05C35, 05C85 |
53 | Kunihiko Sadakane |
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings, pp. 410-421, 2000, Springer, 3-540-41255-7. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
53 | Steven J. Phillips, Jeffery R. Westbrook |
Approximation Algorithms for Restoration Capacity Planning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, pp. 101-115, 1999, Springer, 3-540-66251-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
52 | Ying-Hong Wang |
Image Indexing and Similarity Retrieval Based on A New Spatial Relation Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS Workshops ![In: 21st International Conference on Distributed Computing Systems Workshops (ICDCS 2001 Workshops), 16-19 April 2001, Phoenix, AZ, USA, Proceedings, pp. 396-401, 2001, IEEE Computer Society, 0-7695-1080-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
2-D Strings, LCS algorithm, 2D B&epsilon-string, Image retrieval, image database, spatial reasoning, similarity retrieval, spatial knowledge |
47 | Dimitrios S. Kolovos, Richard F. Paige, Fiona Polack |
The Epsilon Transformation Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICMT@TOOLS ![In: Theory and Practice of Model Transformations - 1st International Conference, ICMT@TOOLS 2008, Zurich, Switzerland, July 1-2, 2008, Proceedings, pp. 46-60, 2008, Springer, 978-3-540-69926-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
47 | Joshua B. Kollat, Patrick M. Reed |
The Value of Online Adaptive Search: A Performance Comparison of NSGAII, epsilon-NSGAII and epsilonMOEA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EMO ![In: Evolutionary Multi-Criterion Optimization, Third International Conference, EMO 2005, Guanajuato, Mexico, March 9-11, 2005, Proceedings, pp. 386-398, 2005, Springer, 3-540-24983-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
47 | Lyudmil Aleksandrov, Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack |
An epsilon-Approximation for Weighted Shortest Paths on Polyhedral Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings, pp. 11-22, 1998, Springer, 3-540-64682-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
45 | Yuval Rabani, Amir Shpilka |
Explicit construction of a small epsilon-net for linear threshold functions. ![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. 649-658, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
linear threshold function, explicit construction, epsilon-net |
45 | Tatsuo Arai |
Epsilon substitution method for [Pi01, Pi01]-FIX. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(8), pp. 1009-1043, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Epsilon substitution, Ordinal interpretation, Termination proof |
45 | Henry Towsner |
Epsilon substitution for transfinite induction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(4), pp. 397-412, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Epsilon substitution, Cut elimination |
45 | Grigori Mints, Darko Sarenac |
Completeness of indexed epsilon-calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 42(7), pp. 617-625, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Epsilon calculus, Finite choice, Completeness |
45 | Pamela Drew, Calton Pu |
Asynchronous consistency restoration under epsilon serializability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (2) ![In: 28th Annual Hawaii International Conference on System Sciences (HICSS-28), January 3-6, 1995, Kihei, Maui, Hawaii, USA, pp. 717-726, 1995, IEEE Computer Society, 0-8186-6945-4. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
consistency restoration, epsilon serializability, data inconsistency, data integrity, concurrency control, object-oriented databases, inconsistency, concurrent processing |
44 | Saharon Shelah |
In the Random Graph G(n, p), p = n-a: If psi Has Probability O(n-epsilon) for Every epsilon>0 Then it Has Probability O(e-nepsilon) for Some epsilon>0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Pure Appl. Log. ![In: Ann. Pure Appl. Log. 82(1), pp. 97-102, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
44 | Raja Epsilon, Jun Ke, Carey L. Williamson |
Analysis of ISP IP/ATM network traffic measurements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMETRICS Perform. Evaluation Rev. ![In: SIGMETRICS Perform. Evaluation Rev. 27(2), pp. 15-24, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
wworkload characterization, web, TCP/IP, TCP/IP, ATM networks, network traffic measurement |
44 | James W. Gray III, Kin Fai Epsilon Ip, King-Shan Lui |
Provable Security for Cryptographic Protocols - Exact Analysis and Engineering Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Secur. ![In: J. Comput. Secur. 6(1-2), pp. 23-52, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
44 | James W. Gray III, Kin Fai Epsilon Ip, King-Shan Lui |
Provable Security for Cryptographic Protocols: Exact Analysis and Engineering Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSFW ![In: 10th Computer Security Foundations Workshop (CSFW '97), June 10-12, 1997, Rockport, Massachusetts, USA, pp. 45-58, 1997, IEEE Computer Society, 0-8186-7990-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
44 | James W. Gray III, Kin Fai Epsilon Ip |
Protocols for issuing public-key certificates over the Internet. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICICS ![In: Information and Communication Security, First International Conference, ICICS'97, Beijing, China, November 11-14, 1997, Proceedings, pp. 424-434, 1997, Springer, 3-540-63696-X. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
43 | Yingquan Wu |
New List Decoding Algorithms for Reed-Solomon and BCH Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 54(8), pp. 3611-3630, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Monaldo Mastrolilli, Ola Svensson |
(Acyclic) JobShops are Hard to Approximate. ![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. 583-592, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Harry Buhrman, John M. Hitchcock |
NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly. ![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. 1-7, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hard sets, polynomial advice, instance complexity |
43 | Eric Allender, Michal Koucký 0001 |
Amplifying Lower Bounds by Means of Self-Reducibility. ![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. 31-40, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
self-reducibility, lower bounds, circuit complexity |
43 | Matt D. Johnson, Daniel R. Tauritz, Ralph W. Wilkerson |
SNDL-MOEA: stored non-domination level MOEA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, pp. 837-844, 2007, ACM, 978-1-59593-697-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
constructive problem solving, pareto optimality, evolutionary multiobjective optimization |
43 | Xuemin Lin 0001, Jian Xu, Qing Zhang 0001, Hongjun Lu, Jeffrey Xu Yu, Xiaofang Zhou 0001, Yidong Yuan |
Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 18(5), pp. 683-698, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
data mining, Query processing, online computation |
43 | Refael Hassin, Asaf Levin |
Approximation Algorithms for Quickest Spanning Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(1), pp. 43-52, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Quickest path problem, Minimum diameter spanning tree problem, Approximation algorithms |
43 | Joan Feigenbaum, Sampath Kannan, Jian Zhang 0004 |
Computing Diameter in the Streaming and Sliding-Window Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(1), pp. 25-41, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Massive data streams, Diameter, Sliding window |
43 | Erez Petrank, Gábor Tardos |
On the Knowledge Complexity of NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(1), pp. 83-121, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 68Q15, 68Q17 |
43 | Oded Goldreich 0001, Avi Wigderson |
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pp. 209-223, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Mario Szegedy, Xiaomin Chen |
Computing Boolean Functions from Multiple Faulty Copies of Input Bits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings, pp. 539-553, 2002, Springer, 3-540-43400-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Jonas Holmerin |
Vertex Cover on 4-Regular Hyper-graphs Is Hard to Approximate within 2 - ε. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 6, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Todd W. Neller |
Action Timing Discretization with Iterative-Refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SARA ![In: Abstraction, Reformulation and Approximation, 5th International Symposium, SARA 2002, Kananaskis, Alberta, Canada, August 2-4, 2002, Proceedings, pp. 170-177, 2002, Springer, 3-540-43941-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | John A. Rose, Russell J. Deaton, Masami Hagiya, Akira Suyama |
The Fidelity of the Tag-Antitag System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DNA ![In: DNA Computing, 7th International Workshop on DNA-Based Computers, DNA7, Tampa, Florida, USA, June 10-13, 2001, Revised Papers, pp. 138-149, 2001, Springer, 3-540-43775-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
43 | Jop F. Sibeyn |
Solving Fundamental Problems on Sparse-Meshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(12), pp. 1324-1332, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Theory of parallel computation, algorithms, routing, networks, sorting, meshes, list-ranking |
43 | Michael Elkin, David Peleg |
Strong Inapproximability of the Basic k-Spanner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 636-647, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
43 | Mikael Goldmann, Alexander Russell |
Spectral Bounds on General Hard Core Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 614-625, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
43 | Limor Drori, David Peleg |
Faster Exact Solutions for Some NP-Hard Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '99, 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999, Proceedings, pp. 450-461, 1999, Springer, 3-540-66251-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
43 | Samarjit Chakraborty, Somenath Biswas |
Approximation Algorithms for 3-D Commom Substructure Identification in Drug and Protein Molecules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pp. 253-264, 1999, Springer, 3-540-66279-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
43 | Michael T. Goodrich, John G. Kloss II |
Tiered Vectors: Efficient Dynamic Arrays for Rank-Based Sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pp. 205-216, 1999, Springer, 3-540-66279-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
dynamic array, JDSL, Java, vector, abstract data type |
43 | Philip N. Klein, Sairam Subramanian |
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 22(3), pp. 235-249, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Minimum-cost path, Minimum-cost path, Shortest path, Shortest path, Graph algorithm, Graph algorithm, Planar graph, Planar graph, Key words, Dynamic algorithm, Dynamic algorithm |
43 | Keqin Li 0001, Yi Pan 0001, Si-Qing Zheng |
Fast and Processor Efficient Parallel Matrix Multiplication Algorithms on a Linear Array With a Reconfigurable Pipelined Bus System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(8), pp. 705-720, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Compound algorithm, optical pipelined bus, Strassen's algorithm, reconfigurability, matrix multiplication, linear array |
43 | Oded Goldreich 0001, Shafi Goldwasser, Eric Lehman, Dana Ron |
Testing Monotonicity. ![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. 426-435, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Approximation Algorithms, Randomized Algorithms, Monotonicity, Property Testing |
43 | Danny Z. Chen, Ovidiu Daescu |
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 4th Annual International Conference, COCOON '98, Taipei, Taiwan, R.o.C., August 12-14, 1998, Proceedings, pp. 45-54, 1998, Springer, 3-540-64824-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
41 | Helen Treharne, Edward Turner, Richard F. Paige, Dimitrios S. Kolovos |
Automatic Generation of Integrated Formal Models Corresponding to UML System Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TOOLS (47) ![In: Objects, Components, Models and Patterns, 47th International Conference, TOOLS EUROPE 2009, Zurich, Switzerland, June 29-July 3, 2009. Proceedings, pp. 357-367, 2009, Springer, 978-3-642-02570-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Epsilon, UML, Model transformation, CSP, B |
41 | Guy Bernard, Andrzej Duda, Yoram Haddad 0002, Gilbert Harrus |
Primitives for Distributed Computing in a Heterogeneous Local Area Network Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(12), pp. 1567-1578, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
heterogeneous local area network environment, interprocess communication mechanisms, network aspects, Epsilon, high-level communication primitives, host names, software engineering, distributed computing, operating systems, local area networks, distributed applications, source code, heterogeneous computers, microcomputers, computer communications software, hardware configuration |
36 | János Pach, Gábor Tardos |
Tight lower bounds for the size of epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 27th ACM Symposium on Computational Geometry, Paris, France, June 13-15, 2011, pp. 458-463, 2011, ACM, 978-1-4503-0682-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
36 | Hernán E. Aguirre, Kiyoshi Tanaka |
Space partitioning with adaptive epsilon-ranking and substitute distance assignments: a comparative study on many-objective mnk-landscapes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009, pp. 547-554, 2009, ACM, 978-1-60558-325-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
evolutionary many-objective optimazation, non-linear fitness functions, combinatorial problems, epistasis |
36 | Dimitrios S. Kolovos |
Establishing Correspondences between Models with the Epsilon Comparison Language. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECMDA-FA ![In: Model Driven Architecture - Foundations and Applications, 5th European Conference, ECMDA-FA 2009, Enschede, The Netherlands, June 23-26, 2009. Proceedings, pp. 146-157, 2009, Springer, 978-3-642-02673-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Christian Horoba, Frank Neumann 0001 |
Benefits and drawbacks for the use of epsilon-dominance in evolutionary multi-objective optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Genetic and Evolutionary Computation Conference, GECCO 2008, Proceedings, Atlanta, GA, USA, July 12-16, 2008, pp. 641-648, 2008, ACM, 978-1-60558-130-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
multi-objective optimization, running time analysis |
35 | Pablo Diaz-Gutierrez, Jonas Bösch, Renato Pajarola, Meenakshisundaram Gopi |
Streaming surface sampling using Gaussian epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Vis. Comput. ![In: Vis. Comput. 25(5-7), pp. 411-421, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Normal quantization, Surface sampling, Shape approximation, Epsilon-nets |
35 | Kasturi R. Varadarajan |
Epsilon nets and union complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 11-16, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, set cover, epsilon nets |
35 | Boris Bukh, Jirí Matousek 0001, Gabriel Nivasch |
Lower bounds for weak epsilon-nets and stair-convexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 1-10, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
inverse ackermann function, selection lemma, stair-convexity, weak epsilon-net |
35 | Boris Aronov, Sariel Har-Peled, Micha Sharir |
On approximate halfspace range counting and relative epsilon-approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 327-336, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
approximate range queries, epsilon-approximations, partition trees, range spaces, queries, discrepancy, range, VC-dimension, halfspaces |
35 | Ricardo Landa Becerra, Carlos A. Coello Coello |
Epsilon-constraint with an efficient cultured differential evolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (Companion) ![In: Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007, Companion Material, pp. 2787-2794, 2007, ACM, 978-1-59593-698-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
epsilon-constraint, multi-objective optimization, differential evolution, cultural algorithms |
35 | Jirí Matousek 0001 |
New constructions of weak epsilon-nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 129-135, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
weak epsilon-nets |
35 | Florent Duguet, George Drettakis |
Robust epsilon visibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 21(3), pp. 567-575, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
3D visibility, epsilon visibility, robust visibility predicates, illumination, shadow algorithms |
35 | Kun-Lung Wu, Philip S. Yu, Calton Pu |
Divergence Control Algorithms for Epsilon Serializability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 9(2), pp. 262-274, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Epsilon serializability, divergence control, concurrency control, transaction processing, serializability |
32 | Ting Wang 0006, Shicong Meng, Bhuvan Bamba, Ling Liu 0001, Calton Pu |
A General Proximity Privacy Principle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDE ![In: Proceedings of the 25th International Conference on Data Engineering, ICDE 2009, March 29 2009 - April 2 2009, Shanghai, China, pp. 1279-1282, 2009, IEEE Computer Society, 978-0-7695-3545-6. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Irit Dinur, Elazar Goldenberg |
Locally Testing Direct Product in the Low Error Range. ![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. 613-622, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Tetsuo Tamai, Naoyasu Ubayashi, Ryoichi Ichiyama |
Objects as Actors Assuming Roles in the Environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SELMAS (LNCS) ![In: Software Engineering for Multi-Agent Systems V, Research Issues and Practical Applications [the book is a result of SELMAS 2006]., pp. 185-203, 2006, Springer, 978-3-540-73130-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Tetsuo Tamai, Naoyasu Ubayashi, Ryoichi Ichiyama |
An adaptive object model with dynamic role binding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSE ![In: 27th International Conference on Software Engineering (ICSE 2005), 15-21 May 2005, St. Louis, Missouri, USA, pp. 166-175, 2005, ACM. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
adaptation, separation of concerns, role model |
32 | Wing-Kai Hon, Tak Wah Lam, Kunihiko Sadakane, Wing-Kin Sung, Siu-Ming Yiu |
Compressed Index for Dynamic Text. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Data Compression Conference ![In: 2004 Data Compression Conference (DCC 2004), 23-25 March 2004, Snowbird, UT, USA, pp. 102-111, 2004, IEEE Computer Society, 0-7695-2082-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Yossi Matias, Ely Porat |
Efficient Pebbling for List Traversal Synopses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 918-928, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Piotr Sankowski |
Alternative Algorithms for Counting All Matchings in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 427-438, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Jinhui Xu 0001, Yang Yang 0012, Zhiyong Lin |
Traveling Salesman Problem of Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 40-49, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Jin-yi Cai |
On the Minimum Volume of a Perturbed Unit Cube. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings, pp. 67-78, 2002, Springer, 3-540-00142-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Wing-Kai Hon, Kunihiko Sadakane |
Space-Economical Algorithms for Finding Maximal Unique Matches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPM ![In: Combinatorial Pattern Matching, 13th Annual Symposium, CPM 2002, Fukuoka, Japan, July 3-5, 2002, Proceedings, pp. 144-152, 2002, Springer, 3-540-43862-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Klaus Jansen |
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 562-573, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Xiaotie Deng, Guojun Li, Zimao Li, Bin Ma 0002, Lusheng Wang 0001 |
A PTAS for Distinguishing (Sub)string Selection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings, pp. 740-751, 2002, Springer, 3-540-43864-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Horng-Ren Tsai |
Parallel Algorithms for the Medial Axis Transform on Linear Arrays with a Reconfigurable Pipelined Bus System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 9th International Conference on Parallel and Distributed Systems, ICPADS 2002, Taiwan, ROC, December 17-20, 2002, pp. 123-128, 2002, IEEE Computer Society, 0-7695-1760-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
linear array with a reconfigurable pipelined bus system, computer vision, parallel algorithms, image processing, image compression, Medial axis transform |
32 | Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano |
Randomness-Optimal Characterization of Two NP Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings, pp. 179-193, 2002, Springer, 3-540-44147-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Tony W. Lai |
Paging on a RAM with Limited Resources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 418-427, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Eyal Even-Dar, Shie Mannor, Yishay Mansour |
PAC Bounds for Multi-armed Bandit and Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Computational Learning Theory, 15th Annual Conference on Computational Learning Theory, COLT 2002, Sydney, Australia, July 8-10, 2002, Proceedings, pp. 255-270, 2002, Springer, 3-540-43836-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Miklós Ajtai, Ravi Kumar 0001, D. Sivakumar 0001 |
Sampling Short Lattice Vectors and the Closest Lattice Vector Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 17th Annual IEEE Conference on Computational Complexity, Montréal, Québec, Canada, May 21-24, 2002, pp. 53-57, 2002, IEEE Computer Society, 0-7695-1468-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
SVP, CVP, Lattice, shortest vector problem, closest vector problem |
32 | Friedhelm Meyer auf der Heide, Christian Scheideler |
Deterministic Routing With Bounded Buffers: Turning Offline Into Online Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 21(1), pp. 95-138, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68W10, 68W20, 68W15 |
32 | Vladlen Koltun |
Segment intersection searching problems in general settings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Seventeenth Annual Symposium on Computational Geometry, Medford, MA, USA, June 3-5, 2001, pp. 197-206, 2001, ACM, 1-58113-357-X. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Eli Ben-Sasson, Nicola Galesi |
Space Complexity of Random Formulae in Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 42-51, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Michael A. Bender, Dana Ron |
Testing Acyclicity of Directed Graphs in Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 809-820, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Jorge Nakahara Jr., Bart Preneel, Joos Vandewalle |
Linear Cryptanalysis of Reduced-Round Versions of the SAFER Block Cipher Family. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSE ![In: Fast Software Encryption, 7th International Workshop, FSE 2000, New York, NY, USA, April 10-12, 2000, Proceedings, pp. 244-261, 2000, Springer, 3-540-41728-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 1216 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|